#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<set>
using namespace std;
#define LL long long
const int maxn = 100005;
int a[maxn];
int main()
{
    int T,n,m;
    ///freopen("in.txt","r",stdin);
    scanf("%d",&T);
    while(T--){
        scanf("%d%d",&n,&m);
        LL sum = 0;
        for(int i = 0;i<n-1;i++){
            scanf("%d",&a[i]);
            sum += a[i];
            a[i] = -a[i];
        }
        if(m>=n)printf("%d\n",n);
        else{
            sort(a,a+n-1);
            for(int i = 0;i<m-1;i++)sum+=a[i];
            printf("%I64d\n",sum+n);
        }
    }
    return 0;
}