#include <cstdio>

#include <cmath>

#include <cstring>

#include <iostream>

#include <algorithm>

#include <queue>

#include <vector>

#include <map>



using namespace std;



typedef long long LL;


int T,n,m;
LL ans;
int a[100005];

int main()

{
    scanf("%d",&T);
    while (T--)
    {
        scanf("%d%d",&n,&m);
        for (int i=1;i<n;++i) scanf("%d",&a[i]);
        ans=n;
        m=n-m;
        sort(a+1,a+n-1+1);
        for (int i=1;i<=m;++i) ans+=a[i];
        printf("%I64d\n",ans);
    }

    return 0;

}