#include<bits/stdc++.h>
using namespace std;
int T,n;
int w[1005];
long long k,sum,num;
priority_queue<long long,vector<long long>,greater<long long> > q;
int main(){
	freopen("NPH.in","r",stdin);
	freopen("NPH.out","w",stdout);
	cin>>T;
	while(T--){
		cin>>n>>k;
		sum=0,num=0;
		for(int i=1;i<=n;i++){
			cin>>w[i]; 
		}
		sort(w+1,w+n+1);
		q.push(w[1]);
		//cout<<"#";
		while(sum<k){
			long long e=q.top();
			//cout<<e<<" ";
			num=e,sum++;
			q.pop();
			for(int i=1;i<=n;i++){
				q.push(e+w[i]);
			}
		}
		//cout<<endl;
		cout<<num<<endl;
	}
	return 0;
}