#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
long long n,m,l,r,a[100010],sum,now,i,T,flag;
int main(){
    scanf("%I64d",&T);
    while (T--)
    {
        sum=0;
        scanf("%I64d%I64d",&n,&m);
        for (i=1;i<=n-1;i++)
        {
            scanf("%I64d",&a[i]);
            sum+=a[i];
        }
        sort(a+1,a+n);
        l=n-1;
        for (i=1;i<=m-1;i++)
        {
            sum-=a[l];
            l--;
            if (l<1) break;
        }
        printf("%I64d\n",sum+n);
    }
}