#include <bits/stdc++.h>
using namespace std;
long long ans = 0;
long long res[300001];
pair<long long, long long> a[300001];
signed main() {
  long long n, k;
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    cin >> a[i].first;
    a[i].second = i;
  }
  sort(a + 1, a + n + 1);
  for (long long i = 1; i <= n; i++) res[i] = res[i - 1] + a[i].first;
  cin >> k;
  for (long long i = 1; i <= k; i++)
    ans += a[i].first * (i - 1) - (res[i - 1] - res[0]);
  long long minv = ans, x = 1;
  for (long long i = 2; i < n - k + 2; i++) {
    ans += (k - 1) * (a[i + k - 1].first + a[i - 1].first) -
           (res[i + k - 2] - res[i - 1]) * 2;
    if (ans < minv) minv = ans, x = i;
  }
  for (long long i = x; i < x + k; i++) cout << a[i].second << " ";
  return 0;
}
