#include <bits/stdc++.h>
using namespace std;
pair<int, int> x[300011];
long long up[300011], bak[300011];
int main() {
  int n, i, j;
  cin >> n;
  for (i = 1; i <= n; i++) scanf("%d", &x[i].first), x[i].second = i;
  sort(x + 1, x + n + 1);
  int k;
  cin >> k;
  for (i = 1; i <= k - 1; i++) bak[k] += x[k].first - x[i].first;
  for (i = k + 1; i <= n; i++)
    bak[i] = bak[i - 1] - (x[i - 1].first - x[i - k].first) +
             (long long)(k - 1) * (x[i].first - x[i - 1].first);
  for (i = 2; i <= k; i++) up[1] += x[i].first - x[1].first;
  for (i = 2; i <= n - k + 1; i++)
    up[i] = up[i - 1] - (long long)(k - 1) * (x[i].first - x[i - 1].first) +
            x[i + k - 1].first - x[i].first;
  long long ans = 0, pos = 1;
  for (i = 1; i <= k - 1; i++) {
    ans += (long long)i * (k - i) * (x[i + 1].first - x[i].first);
  }
  long long tmp = ans;
  for (i = 2; i <= n - k + 1; i++) {
    long long t = tmp;
    t += bak[i + k - 1] - up[i - 1];
    tmp = t;
    if (tmp < ans) ans = tmp, pos = i;
  }
  for (i = pos; i <= pos + k - 1; i++) printf("%d ", x[i].second);
  return 0;
}
