#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e6 + 2;
long long v[maxn], resp, pos, val, r[maxn], k;
map<long long, long long> f;
int32_t main() {
  long long n;
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    cin >> v[i];
    f[v[i]] = i;
  }
  sort(v + 1, v + 1 + n);
  for (long long i = 1; i <= n; i++) r[i] = r[i - 1] + v[i];
  cin >> k;
  for (long long i = 1; i <= k; i++) resp += ((i - 1) * v[i]) + r[i - 1];
  pos = k, val = resp;
  for (long long i = k + 1; i <= n; i++) {
    long long sum = r[i - 1] - r[i - k];
    val += (((k - 1) * v[i]) - sum) - (sum - (k - 1) * v[i - k]);
    if (resp > val) {
      pos = i;
      resp = val;
    }
  }
  for (long long i = pos - k + 1; i <= pos; i++) cout << f[v[i]] << " ";
  cout << "\n";
}
