#include<iostream>
#include<algorithm>
#include<string.h>
#include<string>
#include<stdio.h>
#include<math.h>
#include<stack>
#include<queue>
#include<map>
#include<vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
//#define min(a,b) (a>b?b:a)
//#define max(a,b) (a>b?a:b)
#define mem(a,num) memset(a,num,sizeof(a))
#define inf(a,n) fill(a,a+n,0x3f3f3f3f)

int a[100005];

int main()
{
    int T,n,m;
    cin>>T;
    while(T--){
        scanf("%d%d",&n,&m);
        for(int i = 0;i<n-1;++i)scanf("%d",a+i);
        sort(a,a+n-1);
        ll ans=n;
        for(int i=0;i<n-m;++i)ans+=a[i];
        cout<<ans<<endl;
    }
    return 0;
}