#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <bitset>
#define X first
#define Y second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn=100010;
ll N[maxn];
int main()
{
    int T;
    scanf("%d",&T);
    while (T--)
    {
        int n,k;
        scanf("%d%d",&n,&k);
        for (int i=1;i<n;i++)
            scanf("%I64d",&N[i]);
        sort(N+1,N+n);
        ll sum=0;
        for (int i=n-k;i>0;i--)
        sum+=N[i];
        sum+=n;
        cout<<sum<<endl;
    }
    return 0;
}