#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#define LL long long
#define N 100005
#define MOD 1000000007
#define FOR(i,l,r) for (int i = (l); i <= (r); i ++)
#define CLR(a,x) memset(a,x,sizeof(a))
using namespace std;
LL d[N];
int cmp(LL a,LL b){
    return a > b;
}
int main(){
    int t;
    cin >> t;
    while (t --){
        int n,k;
        scanf("%d%d",&n,&k);
        LL sum = 1;
        FOR(i,1,n - 1) {
                  scanf("%I64d",&d[i]);
                  sum += d[i] + 1;    
        }
        if (k >= n){
            printf("%d\n",n);
            continue;
        }
        sort(d + 1,d + n,cmp);
        FOR(i,1,k - 1)
            sum -= d[i];
        printf("%I64d\n",sum);
    }
}