#include <cstdio>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;

const int MaxN = 1e5;
int n, k, T;
int d[MaxN + 5];

int main()
{
    scanf("%d", &T);
    while(T--)
    {
        scanf("%d%d", &n, &k);
        for(int i = 1; i <= n - 1; i++) 
        {
            scanf("%d", &d[i]);
        }
        int p = n - k;
        sort(d + 1, d + n);
        LL ans = 0;
        for(int i = 1; i <= p; i++)
        {
            ans = ans + d[i];
        }
        ans = ans + n;
        printf("%I64d\n", ans);
    }
}