#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1}, dy[] = {-1, 1, 0, 0, 1, -1, -1, 1};
void run();
int main() {
  ios::sync_with_stdio(0);
  cout << fixed << setprecision(16);
  run();
}
const int maxn = 300300;
int n, k;
pair<int, int> x[maxn];
int coeff(int i) { return -k + 1 + 2 * i; }
void run() {
  cin >> n;
  for (int i = (0); i < (n); ++i) cin >> x[i].first, x[i].second = i;
  cin >> k;
  sort(x, x + n);
  long long sum = 0;
  long long tot = 0;
  long long besttot = 1LL << 62;
  int besti = 0;
  for (int i = (0); i < (k); ++i) {
    sum += x[i].first;
    tot += coeff(i) * (long long)x[i].first;
  }
  besttot = tot;
  for (int i = (k); i < (n); ++i) {
    sum -= x[i - k].first;
    tot -= (long long)x[i - k].first * coeff(0);
    tot -= 2 * sum;
    sum += x[i].first;
    tot += (long long)x[i].first * coeff(k - 1);
    if (tot < besttot) besttot = tot, besti = i - k + 1;
  }
  for (int i = (besti); i < (besti + k); ++i) cout << x[i].second + 1 << " ";
  cout << "\n";
}
