#pragma comment(linker, "/STACK:102400000,102400000")
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstring>
#define LL long long
using namespace std;
const int M=1e5+5,INF=0xc0c0c0c0;
int A[M];
int main() {
    int T;
    scanf("%d",&T);
    while(T--){
        int n,m;
        scanf("%d%d",&n,&m);
        m=min(n,m);
        m--;
        LL sum=1;
        for(int j=1;j<n;j++){
            //printf("j = %d\n",j);
            scanf("%d",&A[j]);
            sum+=A[j]+1;
        }
        sort(A+1,A+n);
        for(int j=n-1;j>n-m-1;j--){
            sum-=A[j];
        }
        printf("%I64d\n",sum);
    }
    return 0;
}