#include <bits/stdc++.h>
using namespace std;
const int size = 41;
const long long modulo = 1000000007;
const long long INF = 1e14;
const double EPS = 1e-10;
int main() {
  cin.sync_with_stdio(0);
  int n;
  cin >> n;
  vector<long long> a(n);
  map<long long, int> ind;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    ind[a[i]] = i + 1;
  }
  sort(a.begin(), a.end());
  int k;
  cin >> k;
  vector<long long> fromLeft(n), fromRight(n);
  fromLeft[0] = 0;
  for (int i = 1; i < n; i++) fromLeft[i] = fromLeft[i - 1] + a[i] - a[0];
  fromRight[n - 1] = 0;
  for (int i = n - 2; i >= 0; i--)
    fromRight[i] = fromRight[i + 1] + a[n - 1] - a[i];
  long long initial = 0, cur = 0;
  for (int i = 1; i < k; i++) {
    cur += i * (a[i] - a[i - 1]);
    initial += cur;
  }
  long long record = initial, start = 0;
  for (int i = 1; i <= n - k; i++) {
    initial -=
        fromLeft[i + k - 2] - fromLeft[i - 1] - (k - 1) * (a[i - 1] - a[0]);
    initial += fromRight[i] - fromRight[i + k - 1] -
               (k - 1) * (a[n - 1] - a[i + k - 1]);
    if (initial < record) {
      start = i;
      record = initial;
    }
  }
  for (int i = 0; i < n; i++)
    if (i >= start && i < start + k) cout << ind[a[i]] << ' ';
  cout << endl;
  return 0;
}
