#include <bits/stdc++.h>
using namespace std;
int n, k;
pair<int, int> x[333333];
int main() {
  while (~scanf("%d", &n)) {
    for (int i = 0; i < n; i++) scanf("%d", &x[i].first), x[i].second = i + 1;
    scanf("%d", &k);
    sort(x, x + n);
    long long sum1 = 0, sum2 = 0, ans = 0;
    for (int i = 0; i < k; i++) sum1 += x[i].first;
    int pos = 0;
    for (int i = k; i < n; i++) {
      sum2 += 1ll * (k - 1) * (x[i].first + x[i - k].first) -
              2ll * (sum1 - x[i - k].first);
      sum1 += x[i].first - x[i - k].first;
      if (sum2 < ans) ans = sum2, pos = i - k + 1;
    }
    for (int i = 0; i < k; i++)
      printf("%d%c", x[pos + i].second, i == k - 1 ? '\n' : ' ');
  }
  return 0;
}
