#include <bits/stdc++.h>
using namespace std;
long long N, K;
pair<long long, int> A[300300];
long long partial[300300];
int main() {
  cin >> N;
  for (int i = 1; i <= N; i++) {
    cin >> A[i].first;
    A[i].second = i;
  }
  cin >> K;
  sort(A + 1, A + 1 + N);
  partial[0] = 0;
  for (int i = 1; i <= N; i++) partial[i] = partial[i - 1] + A[i].first;
  long long total = 0;
  for (int i = 1; i <= K; i++) total += A[i].first * (2 * i - (K + 1));
  long long best = total;
  int besti = 1;
  for (int e = K + 1; e <= N; e++) {
    total -= (partial[e - 1] - partial[e - K]) - (K - 1) * A[e - K].first;
    total += (K - 1) * A[e].first - (partial[e - 1] - partial[e - K]);
    if (total < best) {
      best = total;
      besti = e - K + 1;
    }
  }
  for (int i = besti; i < besti + K; i++) cout << A[i].second << ' ';
  return 0;
}
