#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
#define pb push_back
using namespace std;

typedef long long LL;
const int MAXN = 100010;
int a[MAXN];

int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        int n, k;
        scanf("%d%d", &n, &k);
        LL sum = n;
        for (int i = 1; i <= n - 1; ++i) {
            scanf("%d", &a[i]);
            sum += (LL)a[i];
        }
        if (k >= n) {
            printf("%d\n", n);
            continue;
        }
        sort(a + 1, a + n);
        for (int i = n - 1, j = 0; i >= 1 && j < k - 1; --i, ++j) {
            sum -= (LL)a[i];
        }
        cout << sum << endl;
    }
    return 0;
}