#include <bits/stdc++.h>
using namespace std;
pair<int, int> ar[300003];
long long s[300003];
int main() {
  int n, i, j;
  int k;
  long long x, y, w, z;
  int ans = 1000000000;
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%d", &ar[i].first);
    ar[i].second = i + 1;
  }
  sort(ar, ar + n);
  scanf("%d", &k);
  if (k == n) {
    for (i = 0; i < n; i++) cout << ar[i].second << " ";
    ;
    cout << endl;
    return 0;
  }
  long long p = 0;
  for (i = 0; i <= k; i++) {
    x = ar[i].first;
    p += x;
  }
  s[0] = p;
  for (i = 1, j = k + 1; j < n; i++, j++) {
    x = ar[j].first;
    y = ar[i - 1].first;
    s[i] = s[i - 1] + x - y;
  }
  int ansind = 0;
  long long diff = 0;
  for (i = 0, j = k; j <= n - 1; i++, j++) {
    x = ar[i].first;
    y = ar[j].first;
    z = k + 1;
    w = s[i];
    diff += (((x + y) * z) - (2 * w));
    if (diff < 0) {
      ansind = i + 1;
      diff = 0;
    }
  }
  for (i = ansind; i <= ansind + k - 1; i++) {
    printf("%d ", ar[i].second);
  }
  cout << endl;
}
