#include <bits/stdc++.h>
using namespace std;
const long long sdvig = 100000001LL;
int main() {
  map<long long, long long> m;
  int n, k;
  cin >> n;
  vector<long long> a;
  a.resize((n));
  vector<long long> sum;
  sum.resize(n + 5);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    a[i] += sdvig;
    m[a[i]] = i + 1;
  }
  sort(a.begin(), a.end());
  cin >> k;
  sum[0] = a[0];
  for (int i = 1; i < n; i++) {
    sum[i] = sum[i - 1] + a[i];
  }
  long long Sum = 0;
  for (int i = k - 1; i > 0; i--) Sum += i * a[i] - (sum[i - 1]);
  long long pos = 0;
  long long minSum = Sum;
  for (int i = k; i < n; i++) {
    Sum = Sum + (a[i] * (k - 1) - (sum[i - 1] - sum[i - k])) -
          (sum[i - 1] - sum[i - k] - a[i - k] * (k - 1));
    if (Sum < minSum) {
      pos = i - k + 1;
      minSum = Sum;
    }
  }
  for (int i = pos; i < pos + k; i++) {
    cout << m[a[i]] << " ";
  }
  return 0;
}
