#include <bits/stdc++.h>
using namespace std;
const int MAX = 3e5 + 5;
pair<long double, int> x[MAX];
int main() {
  ios::sync_with_stdio(false);
  int n, id, k;
  cin >> n;
  for (int i = 0; i < (int)(n); i++) {
    cin >> x[i].first;
    x[i].second = i + 1;
  }
  cin >> k;
  sort(x, x + n);
  long double acum1 = 0, acum2 = 0, ans = 0;
  for (long long i = 0; i < k; i++) {
    acum1 += x[i].first;
    acum2 += (x[i].first * ((long double)(i + 1)));
    ans = 2 * acum2 - ((long double)(k + 1)) * acum1;
    id = 0;
  }
  for (long long i = 0; i + k < n; i++) {
    acum2 = (acum2 - acum1 + ((long double)k) * x[i + k].first);
    acum1 = (acum1 - x[i].first + x[i + k].first);
    if (ans > 2 * acum2 - ((long double)(k + 1)) * acum1) {
      id = i + 1, ans = 2 * acum2 - ((long double)(k + 1)) * acum1;
    }
  }
  for (int i = 0; i < (int)(k); i++) {
    if (i) cout << " ";
    cout << x[i + id].second;
  }
  cout << endl;
  return 0;
}
