#include <bits/stdc++.h>
using namespace std;
struct ii {
  int id, x;
} a[327670];
bool cmp(ii x, ii y) { return x.x < y.x; }
long long n, m, i, j, c[327670], ans, mx, pre;
int main() {
  ios::sync_with_stdio(false);
  ;
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> a[i].x;
    a[i].id = i;
  }
  cin >> m;
  sort(a + 1, a + n + 1, cmp);
  for (i = 1; i <= n; i++) {
    c[i] = c[i - 1] + a[i].x;
  }
  for (i = 2; i <= m; i++) {
    pre += (i - 1) * a[i].x - c[i - 1];
  }
  mx = pre;
  ans = 1;
  for (i = 3; i <= n; i++) {
    if (i - 1 + m - 1 <= n) {
      pre += (m - 1) * a[i - 2].x - (c[i - 2 + m - 1] - c[i - 2]);
      pre += (m - 1) * a[i - 1 + m - 1].x - (c[i - 1 + m - 1 - 1] - c[i - 2]);
      if (pre < mx) {
        mx = pre;
        ans = i - 1;
      }
    }
  }
  for (i = 1; i <= m; i++) {
    cout << a[ans + i - 1].id << ' ';
  }
  return 0;
}
