#include <bits/stdc++.h>
using namespace std;
pair<long long int, long long int> A[1000006];
void solve(void) {
  long long int n, k, i, x, q1, q2, qs, q, ans, ansq;
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> x;
    A[i] = make_pair(x, i);
  }
  cin >> k;
  sort(A + 1, A + n + 1);
  q1 = q2 = q = qs = 0;
  for (i = 1; i < k; i++) {
    q1 += (k - i) * (A[i + 1].first - A[i].first);
    q2 += (i - 1) * (A[i + 1].first - A[i].first);
    qs += A[i + 1].first - A[i].first;
    q += (A[i + 1].first - A[i].first) * i * (k - i);
  }
  ansq = k;
  ans = q;
  for (i = k + 1; i <= n; i++) {
    q = q - q1 + q2 + (k - 1) * (A[i].first - A[i - 1].first);
    q2 = q2 - qs + (A[i - k + 1].first - A[i - k].first) +
         (k - 2) * (A[i].first - A[i - 1].first);
    qs = qs - (A[i - k + 1].first - A[i - k].first) +
         (A[i].first - A[i - 1].first);
    q1 = q1 - (k - 1) * (A[i - k + 1].first - A[i - k].first) + qs;
    if (q < ans) ans = q, ansq = i;
  }
  for (i = ansq; i >= ansq - k + 1; i--) cout << A[i].second << " ";
  cout << endl;
}
int main() {
  int i, test;
  test = 1;
  for (i = 1; i <= test; i++) {
    solve();
  }
  return 0;
}
