#include <bits/stdc++.h>
using namespace std;
long long s[1000000], f;
pair<long long, long long> a[1000000];
int main() {
  int n, k;
  cin >> n;
  for (int(i) = (0); i < (n); ++(i)) {
    cin >> a[i].first;
    a[i].second = i + 1;
  }
  sort(a, a + n);
  cin >> k;
  for (int(i) = (0); i < (n); ++(i)) s[i + 1] = s[i] + a[i].first;
  for (int(i) = (0); i < (k); ++(i)) f += a[i].first * i - s[i];
  long long m = f, im = 0;
  for (int(i) = (1); i < (n - k + 1); ++(i)) {
    f -= s[i + k - 1] - s[i - 1] - k * a[i - 1].first;
    f += a[i + k - 1].first * (k - 1) - s[i + k - 1] + s[i];
    if (f < m) {
      m = f;
      im = i;
    }
  }
  for (int(i) = (im); i < (im + k); ++(i)) cout << a[i].second << " ";
  return 0;
}
