//editor: Jan Tang
//problem:
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <cstdlib>
using namespace std;
#define set0(a) memset(a,0,sizeof(a));
#define CIN(a,n) for(int i=1;i<=n;i++) cin>>a[i];
typedef long long ll;
typedef unsigned long long ull;
const int Mod = 1e9+7;
const int maxn = 100005;
const int inf = 0x3f3f3f3f;
int m,n,k,d[maxn],s[maxn];
/*==============================head==========================*/
int main(){
    int t; cin >> t;
    while(t -- > 0){
        ll ans = 0;
        cin >> n >> k;
        n--;
        for(int i = 1; i <= n; i ++){
            scanf("%d",&d[i]);
            ans += d[i];
        }
        sort( d+1, d+n+1);
        for(int i = n; i > max(n-k+1, 0); i-- ){
            ans -= d[i];
        }
        ans += n+1;
        cout<<ans<<endl;
    }
    return 0;
}