#include<algorithm>
#include<cmath>
#include<string.h>
#include<stdio.h>
#include<iostream>
using namespace std;

struct tre
{
    int dist;
    int id;
}d[100010];

bool cmp1(tre x,tre y)
{
    return x.dist>y.dist;
}

bool cmp2(tre x,tre y)
{
    return x.id<y.id;
}


int main ()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int n,k;
        scanf("%d%d",&n,&k);
        memset(d,0,sizeof(d));
        for (int i=0 ;i<n-1;i++)
        {
            scanf("%d",&d[i].dist);//cout <<d[i].dist<<' ';
            d[i].id=i;
        }
        sort (d,d+n-1,cmp1);

        for (int i=0;i<k-1;i++)
        {
            d[i].dist=0;
            //cout <<"a"<<endl;
        }
        sort(d,d+n-1,cmp2);
        long long sum=0LL;
        for (int i=0;i<n-1;i++)
        {

            sum+=(long long )d[i].dist+1LL;
        }
        printf("%I64d\n",sum+1LL);
    }
}