#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<iostream>
#include<ctime>

using namespace std;

#define mset(a,x) memset(a,x,sizeof(a))
#define For(i,l,r) for(int i=(l);i<=(r);i++)
#define Down(i,r,l) for(int i=(r);i>=(l);i--)
#define INF 0x7fffffff

int n,k,w[100005];
long long sum;

void solve()
{
    scanf("%d %d",&n,&k);
    sum=n;
    For(i,1,n-1)
    {
        scanf("%d",&w[i]);
        sum+=w[i];
    }
    sort(w+1,w+n);
    if(k>n) k=n;
    For(i,n-k+1,n-1) sum-=w[i];
    printf("%I64d\n",sum);
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        solve();
    }
    return 0;
}