#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e9;
const long long MOD = 1000000007LL;
struct item {
  double val;
  int id;
  item(double vv, int ii) {
    val = vv;
    id = ii;
  }
  item() {}
  bool operator<(const item it) const { return val < it.val; }
};
int n;
item ar[1111111];
int k;
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> ar[i].val;
    ar[i].id = i + 1;
  }
  sort(ar, ar + n);
  cin >> k;
  double sum = 0;
  double ini = 0, fin = 0;
  for (int i = 1; i < k; i++) {
    ini += (ar[i].val - ar[0].val);
    fin += (ar[i].val - ar[i - 1].val) * (double)i;
    sum += fin;
  }
  double bes = -1.0;
  int bp = 0;
  for (int i = 0; i <= n - k; i++) {
    if (bes == -1 || sum < bes) {
      bp = i;
      bes = sum;
    }
    sum -= ini;
    ini -= (double)(k - 1) * (ar[i + 1].val - ar[i].val);
    ini += (ar[i + k].val - ar[i + 1].val);
    fin -= (ar[i + k - 1].val - ar[i].val);
    fin += (ar[i + k].val - ar[i + k - 1].val) * (double)(k - 1);
    sum += fin;
  }
  vector<int> res;
  for (int i = bp; i < bp + k; i++) res.push_back(ar[i].id);
  sort(res.begin(), res.end());
  for (int i = 0; i < k; i++) cout << res[i] << " ";
  return 0;
}
