#include <bits/stdc++.h>
using namespace std;
int n, k;
long long x[((int)3e5 + 100)];
int p[((int)3e5 + 100)];
long long sum[((int)3e5 + 100)];
bool comp_func(int a, int b) { return x[a] < x[b]; }
int main(int argc, char *argv[]) {
  int pos;
  long long res;
  long long v;
  cin >> n;
  for (int i = 1; i < n + 1; i += 1) {
    cin >> x[i];
    p[i] = i;
  }
  sort(p + 1, p + 1 + n, comp_func);
  sum[0] = 0LL;
  for (int i = 1; i < n + 1; i += 1) {
    sum[i] = sum[i - 1] + x[p[i]];
  }
  cin >> k;
  v = 0LL;
  res = 0LL;
  for (int i = 1; i < k + 1; i += 1) {
    v += (i - 1) * x[p[i]] - sum[i - 1];
  }
  res = v;
  pos = 1;
  for (int i = k + 1; i < n + 1; i += 1) {
    v += x[p[i]] * (k - 1) - (sum[i - 1] - sum[i - k]);
    v -= (sum[i - 1] - sum[i - k]) - (k - 1) * x[p[i - k]];
    if (v < res) {
      res = v;
      pos = i - k + 1;
    }
  }
  for (int i = 0; i < k; i += 1) {
    cout << p[pos + i] << " ";
  }
  cout << endl;
  return 0;
}
