#include <bits/stdc++.h>
using ll = long long;
const ll N = 2 * 1e5 + 5;
const ll mod = 1e9 + 7;
const ll inf = 1e18;
const ll SZ = 101;
const double eps = 1e-9;
using namespace std;
void solve() {
  ll n, k;
  cin >> n;
  vector<pair<ll, ll> > a(n);
  vector<ll> pfx(n, 0);
  for (ll(i) = 0; i < (n); i++) cin >> a[i].first, a[i].second = i;
  cin >> k;
  sort((a).begin(), (a).end());
  for (ll(i) = 0; i < (n); i++) {
    pfx[i] = a[i].first;
    if (i) pfx[i] += pfx[i - 1];
  }
  ll l = 0, r = k - 1, ans = 0;
  ll mul = -(k - 1);
  for (ll(i) = 0; i < (k); i++) {
    ans += mul * a[i].first, mul += 2;
  }
  pair<ll, pair<ll, ll> > xx = {ans, {0, k - 1}};
  for (ll i = 1, j = k; i < n && j < n; ++i, ++j) {
    ans += (k - 1) * a[i - 1].first;
    ans -= 2 * pfx[j - 1] - 2 * pfx[i - 1];
    ans += (k - 1) * a[j].first;
    xx = min(xx, {ans, {i, j}});
  }
  for (ll f = (xx.second.first); f <= (xx.second.second); f++)
    cout << a[f].second + 1 << " ";
}
int32_t main(int32_t argc, char *argv[]) {
  double t1 = clock();
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ll TC = 1, t = 0;
  while (t++ < TC) {
    solve();
  }
  if (false)
    cerr << "Time : " << 1000 * (clock() - t1) / CLOCKS_PER_SEC << " ms\n";
  return 0;
}
