#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=1e5+5;
int n,m,a[N],l[N],r[N];
vector<int> p[N];
void solve(){
	cin>>n>>m;
	m=n-m;
	for(int i=1;i<=n;i++) cin>>a[i],p[a[i]].clear();
	for(int i=1;i<=n;i++) p[a[i]].push_back(i);
	sort(a+1,a+n+1);
	for(int i=1,t=0;i<=n;i++) l[i]=t,t=(a[i]==a[i+1]?t+1:0);
	for(int i=n,t=0;i;i--) r[i]=t,t=(a[i]==a[i-1]?t+1:0);
	ll s=0,s2=0;
	for(int i=1;i<=m;i++) s+=a[i],s2+=a[i]*a[i];
	ll mx=s2*m-s*s;
	int h=m+1;
	for(int i=0;i<m;i++){
		s+=a[n-i]-a[m-i];
		s2+=a[n-i]*a[n-i]-a[m-i]*a[m-i];
		if(a[n-i]==a[m-i]) continue;
		ll v=s2*m-s*s;
		if(v>mx||(v==mx&&p[a[m-i]][l[m-i]]>p[a[n-i]][r[n-i]]))
			mx=v,h=m-i;
	}
	vector<int> ans;
	for(int i=1;i<h;i++) ans.push_back(p[a[i]][l[i]]);
	for(int i=h+n-m;i<=n;i++) ans.push_back(p[a[i]][r[i]]);
	sort(begin(ans),end(ans));
	if(m==1) cout<<"1\n";
	else for(int i=0;i<m;i++) cout<<ans[i]<<" \n"[i==m-1];
}
int main(){
	cin.tie(0)->sync_with_stdio(0);
	int t;
	cin>>t;
	while(t--) solve();
	return 0;
}