#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
using namespace std;
long long a[100005];
long long d[100005];
bool cmp(long long a,long long b)
{
    return a>b;
}
int main(void)
{
    //freopen("in","r",stdin);
    int t;
    cin>>t;
    while(t--)
    {
        int n,k;
        cin>>n>>k;
        for(int i=0;i<n-1;i++)
            scanf("%I64d",&d[i]);
        sort(d,d+n-1);
        long long sum = n;
        if(k<n)
        {
            for(int i=0;i<n-k;i++)
                sum+=d[i];
        }
        cout<<sum<<endl;
    }
    return 0;
}