#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <map>  //GL&HF
#include <set>
typedef long long ll;
const int inf=0x3f3f3f3f;
using namespace std;

ll n,k;
ll a[100010];
int main()
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%I64d%I64d",&n,&k);
        n--;
        for(int i=0;i<n;i++)
            scanf("%I64d",&a[i]);
        sort(a,a+n);
        //
        ll sum=0;
        for(int i=0;i<n-k+1;i++)
            sum+=a[i];
        sum+=(n+1);
        printf("%I64d\n",sum);
    }
    return 0;
}