#include <bits/stdc++.h>
#define int long long
using namespace std;
void solve() {
int n,k;
cin>>n>>k;
vector<int> v(n);
for(int i=0;i<n;i++)cin>>v[i];
sort(v.begin(),v.end());
vector<int> p(n);
p[0]=v[0];
for(int i=1;i<n;i++){
p[i]=v[i]+p[i-1];
}
int i=1;
int j=n-1;
int prev=0;
for(int z=0;z<k;z++){
if(p[i]-prev<=v[j]){
i+=2;
prev=p[i];
}
else{
j--;
}
}
int sum=0;
for(int l=i-1;l<=j;l++){
sum+=v[l];
}
cout<<sum<<endl;
}
signed main() {
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CiNkZWZpbmUgaW50IGxvbmcgbG9uZwp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKCnZvaWQgc29sdmUoKSB7CglpbnQgbixrOwoJY2luPj5uPj5rOwoJdmVjdG9yPGludD4gdihuKTsKCWZvcihpbnQgaT0wO2k8bjtpKyspY2luPj52W2ldOwoJc29ydCh2LmJlZ2luKCksdi5lbmQoKSk7Cgl2ZWN0b3I8aW50PiBwKG4pOwoJcFswXT12WzBdOwoJZm9yKGludCBpPTE7aTxuO2krKyl7CgkJcFtpXT12W2ldK3BbaS0xXTsKCX0KCWludCBpPTE7CglpbnQgaj1uLTE7CglpbnQgcHJldj0wOwoJZm9yKGludCB6PTA7ejxrO3orKyl7CgkJaWYocFtpXS1wcmV2PD12W2pdKXsKCQkJaSs9MjsKCQkJcHJldj1wW2ldOwoJCX0KCQllbHNlewoJCQlqLS07CgkJfQoJfQoJaW50IHN1bT0wOwoJZm9yKGludCBsPWktMTtsPD1qO2wrKyl7CgkJc3VtKz12W2xdOwoJfQoJY291dDw8c3VtPDxlbmRsOwoJCgkKCQp9CgpzaWduZWQgbWFpbigpIHsKICAgIGludCB0OwogICAgY2luID4+IHQ7CiAgICB3aGlsZSAodC0tKSB7CiAgICAgICAgc29sdmUoKTsKICAgIH0KICAgIHJldHVybiAwOwp9Cg==
Ngo1IDEKMiA1IDEgMTAgNgo1IDIKMiA1IDEgMTAgNgozIDEKMSAyIDMKNiAxCjE1IDIyIDEyIDEwIDEzIDExCjYgMgoxNSAyMiAxMiAxMCAxMyAxMQo1IDEKOTk5OTk5OTk2IDk5OTk5OTk5OSA5OTk5OTk5OTcgOTk5OTk5OTk4IDk5OTk5OTk5NQo=
6
5 1
2 5 1 10 6
5 2
2 5 1 10 6
3 1
1 2 3
6 1
15 22 12 10 13 11
6 2
15 22 12 10 13 11
5 1
999999996 999999999 999999997 999999998 999999995