#include <bits/stdc++.h>
struct data {
  long long x;
  int vt;
};
using namespace std;
long long n, k, vt;
long long sum, res;
data a[300001];
int b[300001];
long long c[300001];
bool comp(data i, data j) { return (i.x < j.x || (i.x == j.x && i.vt < j.vt)); }
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i].x;
  for (int i = 0; i < n; i++) a[i].vt = i;
  cin >> k;
  sort(a, a + n, comp);
  c[0] = a[0].x;
  for (int i = 1; i < n; i++) c[i] = c[i - 1] + a[i].x;
  int t = 1 - k;
  for (int i = 0; i < k; i++) {
    sum += a[i].x * t;
    t += 2;
  }
  vt = 0;
  res = sum;
  for (int i = 1; i <= n - k; i++) {
    sum = sum - (c[i + k - 2] - c[i - 1]) + (k - 1) * a[i - 1].x +
          (k - 1) * a[i + k - 1].x - (c[i + k - 2] - c[i - 1]);
    if (sum < res) {
      res = sum;
      vt = i;
    }
  }
  for (int i = vt; i < vt + k; i++) b[i - vt] = a[i].vt;
  sort(b, b + k);
  for (int i = 0; i < k; i++) cout << b[i] + 1 << " ";
}
