#include <bits/stdc++.h>
using namespace std;
long long t,n,k,w[10008],f[10008];
bool vis[10008]; 
bool tp=0;
vector<int>ss;
int main(){
	freopen("NPH.in","r",stdin); 
	freopen("NPH.out","w",stdout);
	cin>>t;
	while(t--){
		memset(w,sizeof(w),0); 
		memset(f,sizeof(f),0); 
		memset(vis,sizeof(vis),0); 	
		ss.clear();	
		tp=0;
		cin>>n>>k;
		for(int i=1;i<=n;i++){
			cin>>w[i];
			if(w[i]!=1){
				tp=1;
			} 
		}
		if(n==1){
			cout<<k*w[1]<<"\n";
		}
		else if(tp==0){
			cout<<k*w[1]<<"\n"; 
		}
		else{
			bool sd=0;
			for(int i=2;i<=n;i++){
				if(w[i]!=w[i-1]){
					sd=1;
				}
			}
			if(sd==0){
				cout<<k*w[1];
			}
			else{
				sort(w+1,w+n+1);
				int tot=0;
				for(int i=1;i<=n;i++){
					if(vis[w[i]]==0){
						tot++;
						vis[w[i]]=1;
						ss.push_back(w[i]);
					}
				}
				if(k<tot){
					cout<<ss[k-1]<<"\n";
				}
			}
		}
	}

	return 0;
}