#include <bits/stdc++.h>
using namespace std;
const int maxn = 300005;
pair<int, int> a[maxn];
long long sum[maxn];
int N, K, st, cs;
long long ans, nowans;
int main() {
  scanf("%d", &N);
  for (int i = 1; i <= N; i++) {
    scanf("%d", &cs);
    a[i] = make_pair(cs, i);
  }
  sort(a + 1, a + N + 1);
  scanf("%d", &K);
  sum[0] = 0;
  for (int i = 1; i <= N; i++) sum[i] = sum[i - 1] + a[i].first;
  nowans = 0;
  for (int i = 2; i <= K; i++)
    nowans += (long long)a[i].first * (i - 1) - sum[i - 1];
  ans = nowans;
  st = 1;
  for (int i = K + 1; i <= N; i++) {
    nowans += (long long)a[i].first * (K - 1) - (sum[i - 1] - sum[i - K]);
    nowans -= (sum[i - 1] - sum[i - K]) - (long long)a[i - K].first * (K - 1);
    if (nowans < ans) {
      ans = nowans;
      st = i - K + 1;
    }
  }
  for (int i = st; i <= st + K - 2; i++) printf("%d ", a[i].second);
  printf("%d\n", a[st + K - 1].second);
  return 0;
}
