// created:  2024-10-12 10:32:01
#include<cstdio>
#include<cctype>
#include<algorithm>
#include<vector>
#define F(i,l,r) for(int i=l,i##_end=r;i<i##_end;++i)
#define I128 //||is_same<T,__int128_t>::value||is_same<T,__uint128_t>::value
using namespace std;
template<typename T>enable_if_t<is_integral<T>::value I128,void> readmain(T &x)
{
	bool neg=false;int c=getchar();
	for(;!isdigit(c);c=getchar())if(c=='-')neg=true;
	for(x=0;isdigit(c);c=getchar())x=(T)(10*x+(c-'0'));
	if(neg)x=-x;
}
template<typename T>T& read(T &x){readmain(x);return x;}
template<typename T,typename ...Tr>void read(T &x,Tr&... r){readmain(x);read(r...);}
typedef long long ll;
constexpr int N=1e5+5;
int n,m,b[N],a[N],c[N];
ll s1,s2,mv;
vector<int> seq(int k)
{
	vector<int> s;s.reserve(n-m);
	F(i,0,k)++c[a[i]];
	F(i,k+m,n)++c[a[i]];
	F(i,0,n)if(c[b[i]])--c[b[i]],s.emplace_back(i);
	return s;
}
void solve()
{
	read(n,m);
	F(i,0,n)b[i]=read(a[i]);
	if(!m)
	{
		F(i,0,n)printf("%d%c",i+1," \n"[i==n-1]);
		return;
	}
	if(m==n-1)
	{
		puts("1");
		return;
	}
	sort(a,a+n);
	s1=s2=0;
	F(i,m,n)s1+=a[i],s2+=(ll)a[i]*a[i];
	mv=(n-m)*s2-s1*s1;
	F(i,m,n)
	{
		s1-=a[i],s2-=(ll)a[i]*a[i];
		s1+=a[i-m],s2+=(ll)a[i-m]*a[i-m];
		mv=max(mv,(n-m)*s2-s1*s1);
	}
	vector<int> ans=vector<int>(1,n);
	bool fi=true;
	s1=s2=0;
	F(i,m,n)s1+=a[i],s2+=(ll)a[i]*a[i];
	if(mv==(n-m)*s2-s1*s1&&fi)ans=min(ans,seq(0));
	F(i,m,n)
	{
		s1-=a[i],s2-=(ll)a[i]*a[i];
		s1+=a[i-m],s2+=(ll)a[i-m]*a[i-m];
		fi=a[i]!=a[i-m];
		if(mv==(n-m)*s2-s1*s1&&fi)ans=min(ans,seq(i-m+1));
	}
	m=n-m;
	F(i,0,m)printf("%d%c",ans[i]+1," \n"[i==m-1]);
}
int main()
{
	int tt;read(tt);
	while(tt--)solve();
	return 0;
}