#include <bits/stdc++.h>
using namespace std;
void file() {}
void fast() {
  std::ios_base::sync_with_stdio(0);
  cin.tie(NULL);
}
int main() {
  file();
  fast();
  int n, k;
  cin >> n;
  vector<long long> v1(n);
  for (int i = 0; i < n; i++) cin >> v1[i];
  cin >> k;
  map<int, int> idx;
  for (int i = 0; i < n; i++) idx[v1[i]] = i + 1;
  sort(v1.begin(), v1.end());
  int start = 0, end = 0, s1, s2;
  long long sum = 0, mn = LLONG_MAX, pre = 0;
  while (start <= n - k) {
    while (end - start < k && end < n) {
      sum += abs((end - start) * (v1[end]) - pre);
      pre += v1[end];
      end++;
    }
    if (sum <= mn) {
      mn = sum;
      s1 = start;
      s2 = end;
    }
    pre -= v1[start];
    sum -= abs((end - start - 1) * v1[start] - pre);
    start++;
  }
  for (int i = s1; i < s2; i++) cout << idx[v1[i]] << " ";
  cout << "\n";
  return 0;
}
