#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
#include <string>
#include <map>
#include <cstring>
#include <queue>
using namespace std;
typedef __int64 LL;
const int MAXN = 1e5 + 1;
int main()
{
    int t; scanf("%d", &t);
    while(t--) {
        int n, k; scanf("%d%d", &n, &k);
        priority_queue<int, vector<int>, less<int> > Q;
        for(int i = 1; i <= n - 1; i++) {
            int d; scanf("%d", &d); Q.push(d);
        }
        k--;
        while(!Q.empty() && k > 0) {
            Q.pop(); k--;
        }
        LL ans = 0;
        while(!Q.empty()) {
            ans += Q.top(); Q.pop();
        }
        printf("%I64d\n", ans + n);
    }
    return 0;
}