#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
const int maxn=100010;
typedef long long ll;
int d[maxn];
int main(){
    int t;
    cin>>t;
    while(t--){
        int n,k;
        scanf("%d%d",&n,&k);
        for(int i=0;i<n-1;i++){
            scanf("%d",&d[i]);
        }
        sort(d,d+n-1);
        ll ans=0;
        if(k>n-1) cout<<n<<endl;
        else{
            for(int i=0;i<n-k;i++){
                ans+=d[i]+1;
            }
            ans+=k;
            cout<<ans<<endl;
        }
    }
    return 0;
}