#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef array<int,2> pr;
const ll N = 1e5+10,INF = 4e18;
template<typename T>void tomin(T& x,T y){x = min(x,y);}
template<typename T>void tomax(T& x,T y){x = max(x,y);}
//
int T,n,m; ll pre[N],pre2[N],suf[N],suf2[N];
pr a[N]; ll ans; vector<int> res;

ll F(int i){
    ll S = pre[i] + suf[n-(m-i)+1];
    ll S2 = pre2[i] + suf2[n-(m-i)+1];
    return m*S2 - S*S;
}

int cmp(vector<int>& x,vector<int>& y){
    for(int i=0;i<m;i++)if(x[i]!=y[i])return x[i] > y[i];
    return 0;
}

void solve(){
    cin>>n>>m; m = n-m;
    for(int i=1;i<=n;i++)cin>>a[i][0],a[i][1] = i;
    if(m==1){
        cout<<"1\n";
        return;
    }
    sort(a+1,a+1+n); 
    pre[0] = suf[n+1] = 0; for(int i=1;i<=n;i++)pre[i] = pre[i-1] + a[i][0]; for(int i=n;i>=1;i--)suf[i] = suf[i+1] + a[i][0];
    pre2[0] = suf2[n+1] = 0; for(int i=1;i<=n;i++)pre2[i] = pre2[i-1] + a[i][0]*a[i][0]; for(int i=n;i>=1;i--)suf2[i] = suf2[i+1] + a[i][0] * a[i][0];
    ans = -INF; res.clear();
    for(int i=m;i>=0;i--)if(F(i) > ans)ans = F(i);
    for(int i=m;i>=0;i--){
        int L = i,R = n-(m-i)+1;
        if(L && R<=n && a[L][0] == a[R][0])continue;
        if(F(i) == ans){
            vector<int> now; 
            for(int j=1;j<=L;j++)now.push_back(a[j][1]); 
            int k = R,p = R; 
            while(k<n && a[k+1][0] == a[k][0])k++;
            while(p != n+1 && p-1>L && a[p-1][0] == a[p][0])p--;
            for(int j=k+1;j<=n;j++)now.push_back(a[j][1]);
            int cnt = k-R+1; if(i==m)cnt = 0;
            for(int j=0;j<cnt;j++)now.push_back(a[p+j][1]);
            sort(now.begin(),now.end());
            if(res.empty() || cmp(res,now))res = now;
        }

    }
    for(int i=0;i<m-1;i++)cout<<res[i]<<" "; cout<<res[m-1]<<"\n";
}

int main(){
    ios::sync_with_stdio(false); cin.tie(0);
    cin>>T;
    while(T--)solve();

    return 0;
}