#include <bits/stdc++.h>
using namespace std;
const int N = 300000;
const int inf = (int)1e9 + 1;
const long long big = (long long)1e18 + 1;
const int P = 239;
const int MOD = (int)1e9 + 7;
const int MOD1 = (int)1e9 + 9;
const long double eps = 1e-9;
const long double pi = atan2(0, -1);
const int ABC = 26;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.precision(20);
  int n, k;
  cin >> n;
  pair<int, int> a[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i].first;
    a[i].second = i;
  }
  cin >> k;
  sort(a, a + n);
  long long best = big * 8, cur = 0, cur_sum = 0;
  int pos = -1;
  for (int i = 0; i < k; i++) {
    cur += (long long)(i - (k - i - 1)) * a[i].first;
    cur_sum += a[i].first;
  }
  for (int i = 0; i < n - k + 1; i++) {
    if (cur < best) {
      best = cur;
      pos = i;
    }
    if (i == n - k) break;
    cur += (long long)(k - 1) * a[i].first;
    cur_sum -= a[i].first;
    cur -= cur_sum * 2;
    cur += (long long)(k - 1) * a[i + k].first;
    cur_sum += a[i + k].first;
  }
  assert(pos != -1);
  for (int i = 0; i < k; i++) cout << a[pos + i].second + 1 << " ";
  cout << "\n";
  return 0;
}
