#include <bits/stdc++.h>
using namespace std;
const int oo = (int)1e9;
const double PI = 2 * acos(0.0);
const double eps = 1e-9;
long long n, m;
long long sum[300010], com = 0;
pair<long long, long long> arr[300010];
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n;
  long long x;
  for (int i = 0; i < (int)(n); i++) {
    cin >> x;
    arr[i] = make_pair(x, i + 1);
  }
  sort(arr, arr + n);
  cin >> m;
  memset(sum, 0, sizeof(sum));
  sum[0] = 0;
  for (int i = 0; i < (int)(m); i++) sum[i + 1] = arr[i].first + sum[i];
  for (int i = 1; i < (int)(m); i++) com += arr[i].first * i - sum[i];
  long long bstans = 0, bstcom = com;
  for (int i = m; i < (int)(n); i++) {
    sum[i + 1] = arr[i].first + sum[i];
    com = com + arr[i - m].first * (m - 1) - (sum[i] - sum[i - m + 1]) +
          arr[i].first * (m - 1) - (sum[i] - sum[i - m + 1]);
    if (com < bstcom) bstcom = com, bstans = i - m + 1;
  }
  cout << arr[bstans].second;
  for (int i = 1; i < (int)(m); i++) cout << " " << arr[bstans + i].second;
  cout << endl;
  return 0;
}
