#include <bits/stdc++.h>
using namespace std;
int i, i0, n, m;
pair<int, int> a[300005];
long long ans, sum, tmp;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i].first), a[i].second = i;
  sort(a + 1, a + 1 + n);
  scanf("%d", &m);
  for (int i = 1; i <= m; i++) {
    sum += a[i].first;
    tmp += (long long)i * a[i].first - sum;
  }
  ans = tmp;
  int l = 0;
  for (int i = m + 1; i <= n; i++) {
    tmp -= sum - (long long)m * a[i - m].first;
    sum -= a[i - m].first;
    sum += a[i].first;
    tmp += (long long)m * a[i].first - sum;
    if (ans > tmp) ans = tmp, l = i - m;
    ans = min(ans, tmp);
  }
  for (int i = 1; i <= m; i++)
    printf("%d%c", a[l + i].second, i == m ? '\n' : ' ');
  return 0;
}
