#include <bits/stdc++.h>
using namespace std;
const long long maxn = 3e6 + 5;
long long b[maxn], sum[maxn];
long long n, k;
bool vis[maxn];
pair<long long, long long> a[maxn];
int main() {
  scanf("%lld", &n);
  for (long long i = 1; i <= n; i++)
    scanf("%lld", &b[i]), a[i] = make_pair(b[i], i);
  sort(a + 1, a + n + 1);
  scanf("%lld", &k);
  for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i].first;
  long long ans = 0ll, cnt = 0ll;
  for (long long i = 1; i <= k; i++) {
    cnt += a[i].first * (i - 1ll) - sum[i - 1];
  }
  ans = cnt;
  long long p = 1;
  for (long long i = 2; i + k - 1 <= n; i++) {
    cnt += (k - 1) * (a[i + k - 1].first + a[i - 1].first) -
           (sum[i + k - 2] - sum[i - 1]) * 2;
    if (cnt < ans) {
      ans = cnt;
      p = i;
    }
  }
  for (long long i = p; i <= p + k - 1; i++) vis[a[i].second] = true;
  for (long long i = 1; i <= n; i++)
    if (vis[i]) printf("%lld ", i);
  return 0;
}
