#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
int n, k;
pair<long long, int> X[300005];
long long x[300005];
long long sumL[300005], sumR[300005];
void solve() {
  sort(X, X + n);
  for (int i = 0; i < n; i++) {
    x[i] = X[i].first;
  }
  sumR[n - 1] = 0;
  for (int i = n - 2; i >= 0; i--) {
    if (i >= n - k) {
      sumR[i] = sumR[i + 1] + (n - 1 - i) * (x[i + 1] - x[i]);
    } else {
      sumR[i] =
          sumR[i + 1] - (x[i + k] - x[i + 1]) + (k - 1) * (x[i + 1] - x[i]);
    }
  }
  sumL[0] = 0;
  for (int i = 1; i < n; i++) {
    if (i < k) {
      sumL[i] = sumL[i - 1] + i * (x[i] - x[i - 1]);
    } else {
      sumL[i] =
          sumL[i - 1] - (x[i - 1] - x[i - k]) + (k - 1) * (x[i] - x[i - 1]);
    }
  }
  int id = 0;
  long long ans = 0;
  for (int i = 0; i < k; i++) {
    ans += sumL[i];
  }
  long long curr = ans;
  for (int i = k; i < n; i++) {
    curr += sumL[i];
    curr -= sumR[i - k];
    if (curr < ans) {
      id = i - k + 1;
      ans = curr;
    }
  }
  for (int i = id; i < id + k; i++) {
    cout << X[i].second << ' ';
  }
  cout << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  while (cin >> n) {
    for (int i = 0; i < n; i++) {
      cin >> X[i].first;
      X[i].second = i + 1;
    }
    cin >> k;
    solve();
  }
}
