#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int ttt,n,k,i,a[100010];
long long ans;
int main(){
    cin>>ttt;
    while (ttt--){
        cin>>n>>k;
        k=n-k;
        n--;
        for (i=1;i<=n;i++) scanf("%d",&a[i]);
        sort(a+1,a+1+n);
        for (ans=0,i=1;i<=k;i++) ans+=a[i];
        ans+=n+1;
        cout<<ans<<"\n";
    }
    return 0;
}