#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <set>
#define m_p make_pair
#define p_b push_bakc
#define fi first
#define se second
#define LL long long
using namespace std;
const int maxn = 100010;
int a[maxn];
int n;
int main()
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    int tt; scanf("%d",&tt);
    while (tt--)
    {
        int k;
        scanf("%d%d",&n,&k);
        for (int i=1; i<n; i++)
            scanf("%d",&a[i]);
        LL ans=0;
        sort(a+1,a+n);
        for (int i=1; i<=n-k; i++)
            ans+=(LL) a[i];
        ans+=(LL) n;
        printf("%I64d\n",ans);
    }
    return 0;
}