#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
bool f[5100];
int a[100100];
int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        int n, k;
        LL sum = 0;
        scanf("%d%d", &n, &k);
        for (int i = 1; i < n; ++i) {
            scanf("%d", &a[i]);
            sum += a[i];
        }
        if (k >= n) {
            printf("%d\n", n);
            continue;
        }
        k--;
        sort(a + 1, a + n);
        for (int i = n - 1; i > n - k - 1; --i) {
            sum -= a[i];
        }
        printf("%I64d\n", sum + n);
    }
    return 0;
}