#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 9;
const long long inf = 1e60;
struct D {
  int id, v;
  D() {}
  D(int _id, int _v) : id(_id), v(_v) {}
  bool operator<(const D &o) const { return v < o.v; }
} a[N];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    int x;
    scanf("%d", &x);
    a[i] = D(i, x);
  }
  int k;
  scanf("%d", &k);
  sort(a + 1, a + n + 1);
  long long c = 0, s = 0, c2 = 0;
  int j = -1;
  long long mi = inf;
  for (int i = 2; i <= n; ++i) {
    if (i <= k) {
      c += 1LL * (a[i].v - a[i - 1].v) * (i - 1);
      c2 += 1LL * (a[i].v - a[i - 1].v) * (k - i + 1);
      s += c;
    } else {
      s -= c2;
      c2 -= 1LL * (k - 1) * (a[i - k + 1].v - a[i - k].v);
      c2 += (a[i].v - a[i - k + 1].v);
      c -= (a[i - 1].v - a[i - k].v);
      c += 1LL * (k - 1) * (a[i].v - a[i - 1].v);
      s += c;
    }
    if (i >= k) {
      if (mi > s) {
        mi = s;
        j = i;
      }
    }
  }
  for (int i = j - k + 1; i <= j; ++i) printf("%d ", a[i].id);
  return 0;
}
