#include <stdio.h>
#include <algorithm>
#include <string.h>

using namespace std;
typedef __int64 ll;

int main(){
    int t,n,k,m,a[100005],b[100005],i,j;
    scanf("%d",&t);
    while(t--){
        scanf("%d%d",&n,&k);
        ll sum = 0;
        memset(b,0,sizeof(b));
        b[0] = 1;
        for(i = 0;i < n-1;i++){
            scanf("%d",&a[i]);
            sum+=a[i];
            m = i+1;
            b[m] =
            a[i]+1;
        }
        sum += n;
        sort(b,b+n);
        if(k > n)  k = n;
        for(j = k,i = n-1;j>1;j--,i--){
            sum = sum-b[i]+1;
        }
        printf("%I64d\n",sum);
    }
    return 0;
}