#include <bits/stdc++.h>
using namespace std;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

const int N = 100005, V = 10005;
int n, a[N], m;
vector <int> adj[V];
int cnt[V], ans[N], cvs[N];
long long res = 0;
set <int> mdf[2];

inline void Read() {
	cin >> n >> m;
	for (int i = 1;i <= n;i++) {
		cin >> a[i];
		adj[a[i]].push_back(i);
	}
}

inline void Solve() {
	if (m == n - 1) {
		cout << 1 << "\n";
		return;
	}
	sort(a + 1, a + n + 1);
	long long s1 = 0, s2 = 0;
	for (int i = 1;i <= n;i++) ans[i] = cvs[i] = 0;
	for (int i = m + 1;i <= n;i++) {
		ans[adj[a[i]][cnt[a[i]]]] = cvs[adj[a[i]][cnt[a[i]]]] = 1;
		cnt[a[i]]++;
		s1 += a[i];
		s2 += 1ll * a[i] * a[i];
	}
	res = (n - m) * s2 - s1 * s1;
	mdf[0].clear();
	mdf[1].clear();
	for (int i = 1;i <= n - m;i++) {
		cnt[a[i + m]]--;
		int pos = adj[a[i + m]][cnt[a[i + m]]];
		s1 -= a[i + m]; s2 -= 1ll * a[i + m] * a[i + m];
		// cout << pos << " " << cvs[pos] << "\n";
		if (cvs[pos] != ans[pos]) mdf[ans[pos]].erase(pos);
		cvs[pos] = 0;
		if (cvs[pos] != ans[pos]) mdf[ans[pos]].insert(pos);
		
		pos = adj[a[i]][cnt[a[i]]];
		cnt[a[i]]++;
		s1 += a[i]; s2 += 1ll * a[i] * a[i];
		// cout << pos << " " << cvs[pos] << "\n";
		if (cvs[pos] != ans[pos]) mdf[ans[pos]].erase(pos);
		cvs[pos] = 1;
		if (cvs[pos] != ans[pos]) mdf[ans[pos]].insert(pos);
		if ((n - m) * s2 - s1 * s1 > res || ((n - m) * s2 - s1 * s1 == res && !mdf[0].empty() && *(mdf[0].begin()) < *(mdf[1].begin()))) {
			for (int x : mdf[0]) ans[x] = cvs[x];
			for (int x : mdf[1]) ans[x] = cvs[x];
			// cout << (n - m) * s2 - s1 * s1 << endl;
			// for (int i = 1;i <= n;i++) cout << cvs[i] << ' ';
			// cout << endl;
			mdf[0].clear();
			mdf[1].clear();
			res = (n - m) * s2 - s1 * s1;
		}
	}
	int cnt1 = 0;
	for (int i = 1;i <= n;i++) {
		if (ans[i]) {
			cnt1++;
			cout << i << " \n"[cnt1 == n - m];
		}
	}
}

inline void Clear() {
/*
	int n, a[N];
vector <int> adj[V];
int cnt[V], ans[N], cvs[N];
long long res = 0;
set <int> mdf[2];*/
	for (int i = 1;i <= n;i++) {
		adj[a[i]].clear();
		cnt[a[i]] = 0;
		ans[i] = cvs[i] = 0;
	}
	res = 0;
	mdf[0].clear();
	mdf[1].clear();
}

int main() {
	std::ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int t;
	cin >> t;
	while (t--) {
		Read();
		Solve();
		Clear();
	}
	return 0;
}