#include <bits/stdc++.h>
using namespace std;
pair<long long, int> seq[(3 * (long long)1e5)];
long long sum[(3 * (long long)1e5)];
int main() {
  int N;
  cin >> N;
  for (int i = 0; i < N; i += 1) {
    cin >> seq[i].first;
    seq[i].second = i + 1;
  }
  sort(seq, seq + N);
  if (seq[0].first != 0) {
    int X = -seq[0].first;
    for (int i = 0; i < N; i += 1) seq[i].first += X;
  }
  for (int i = 1; i < N; i += 1) sum[i] = sum[i - 1] + seq[i].first;
  int K;
  cin >> K;
  long long ret = 0;
  for (int i = 1; i < K; i += 1)
    ret += seq[i].first * (i) - (sum[i - 1] - sum[0 - 1]);
  long long mn = ret, idx = 0;
  for (int i = 1; i < N - K + 1; i += 1) {
    ret = ret - ((sum[i + K - 2] - sum[i - 1]) - seq[i - 1].first * (K - 1)) +
          (seq[i + K - 1].first * (K - 1) - (sum[i + K - 2] - sum[i - 1]));
    if (ret < mn) {
      mn = ret;
      idx = i;
    }
  }
  for (int i = idx; i < idx + K; i += 1) cout << seq[i].second << " ";
  cout << endl;
}
