#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void smin(T &a, T b) {
  if (b < a) a = b;
}
template <class T>
inline void smax(T &a, T b) {
  if (a < b) a = b;
}
const int maxn = 3 * 100000 + 1000;
int n, k;
pair<int, int> p[maxn];
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n;
  for (int i = 0, _n = (int)(n); i < _n; i++)
    cin >> p[i].first, p[i].second = i;
  cin >> k;
  sort(p, p + n);
  long long sumx = 0, sumd = 0;
  int c = 0;
  long long best = 1LL << 62;
  int pos = -1;
  for (int i = 0, _n = (int)(n + 1); i < _n; i++) {
    if (c == k && sumd < best) best = sumd, pos = i;
    if (i - k >= 0)
      sumx -= p[i - k].first, c--, sumd -= sumx - p[i - k].first * (long long)c;
    if (i < n)
      sumd += p[i].first * (long long)c - sumx, sumx += p[i].first, c++;
  }
  for (int i = 0, _n = (int)(k); i < _n; i++)
    cout << p[pos - i - 1].second + 1 << ' ';
  cout << endl;
  { return 0; }
}
