#include <bits/stdc++.h>
using namespace std;
const int N = 1 << 19;
int n, k, x;
vector<pair<int, int> > v;
long long sum[N], f[N];
long long seg(int l, int r) { return l == 0 ? sum[r] : sum[r] - sum[l - 1]; }
int main() {
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> x;
    v.push_back(make_pair(x, i));
  }
  sort(v.begin(), v.end());
  cin >> k;
  for (int i = 0; i < n; ++i)
    sum[i] = (i == 0 ? v[i].first : v[i].first + sum[i - 1]);
  f[0] = 0;
  for (int i = 1; i < k; ++i) f[0] += 1LL * i * seg(0, i - 1);
  for (int i = 1; i + k - 1 < n; ++i) {
    f[i] = f[i - 1] - (seg(i, i + k - 2) - 1LL * (k - 1) * v[i - 1].first) +
           (1LL * (k - 1) * v[i + k - 1].first - seg(i, i + k - 2));
  }
  long long min_val = f[0];
  int min_pos = 0;
  for (int i = 1; i + k - 1 < n; ++i) {
    if (min_val > f[i]) {
      min_val = f[i];
      min_pos = i;
    }
  }
  for (int i = 0; i < k; ++i) cout << v[min_pos + i].second + 1 << " ";
  cout << endl;
  return 0;
}
