#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
#define LL long long
int t, k, n;
int s[100010];

bool cmp(int x, int y)
{
    return x > y;
}

int main()
{
    scanf("%d", &t);
    for(int tm = 1; tm <= t; tm++)
    {
        scanf("%d%d", &n, &k);
        for(int i = 0; i < n-1; i++)
        {
            scanf("%d", &s[i]);
        }
        sort(s, s+n-1, cmp);
        LL ans = n;
        for(int i = k-1; i < n-1; i++) ans += s[i];
        printf("%I64d\n", ans);
    }
    return 0;
}