#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
ll a[maxn];
int main(){
    ll t, n, k, sum;
    cin >> t;
    while(t--){    
        scanf("%I64d %I64d", &n, &k);
        sum = n;
        
        
        for(int i = 0; i < n - 1; i++){
            scanf("%I64d", &a[i]);
            sum += a[i];
        }
        
        if(k >= n){
            printf("%I64d\n", n);
            continue;
        }
        
        sort(a, a + n - 1);
        
        int q = n - 2;
        while(k > 1){
            sum -= a[q--];
            k--;
        }

        printf("%I64d\n", sum);
    }
    
    return 0;
}