#include <cstdio>
#include <iostream>
#include <algorithm>
#define rpt(i,l,r) for(int i=l;i<=r;i++)
#define rpd(i,r,l) for(int i=r;i>=l;i--)
#define N 100005
int T,n,k,a[N];
long long ans;
int main(){
    scanf("%d",&T);
    while(T--){
        scanf("%d%d",&n,&k);
        k=k>n?0:n-k;
        rpt(i,1,n-1) scanf("%d",&a[i]);
        std::sort(a+1,a+n);
        ans=0;
        rpt(i,1,k) ans+=a[i];
        printf("%I64d\n",ans+n);
    }
}