#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> A[300005];
long long D[300005], n, k;
int main() {
  long long sum = 0, ans = 0, s = 1;
  scanf("%lld", &n);
  for (int i = 1; i <= n; i++) scanf("%lld", &A[i].first), A[i].second = i;
  scanf("%lld", &k);
  sort(A + 1, A + n + 1);
  for (int i = 1; i <= n; i++) D[i] = D[i - 1] + A[i].first;
  for (int i = 1; i <= k; i++) sum += A[i].first * (i - 1) - D[i - 1];
  ans = sum;
  for (int i = 1; i <= n - k; i++) {
    sum += A[i + k].first * (k - 1) + 2 * (-D[i + k - 1] + D[i]) +
           A[i].first * (k - 1);
    if (sum < ans) ans = sum, s = i + 1;
  }
  for (int i = s; i <= s + k - 1; i++) printf("%lld ", A[i].second);
  puts("");
  return 0;
}
