#include <bits/stdc++.h>
using namespace std;
long long n, k;
vector<pair<long long, long long> > s;
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  s.resize(n);
  long long i;
  for (i = 0; i < n; ++i) {
    cin >> s[i].first;
    s[i].second = i + 1;
  }
  sort(s.begin(), s.end());
  cin >> k;
  long long sum = 0, c = (1 - k), csum = 0, msum = -1, st;
  for (i = 0; i < n; ++i) {
    if (i < k) {
      sum += c * s[i].first;
      csum += s[i].first;
      c += 2;
    } else {
      sum -= (1 - k) * s[i - k].first;
      csum -= s[i - k].first;
      sum -= 2 * csum;
      sum += (k - 1) * s[i].first;
      csum += s[i].first;
    }
    if (i >= k - 1) {
      if (msum == -1 || sum < msum) {
        msum = sum;
        st = i - k + 1;
      }
    }
  }
  for (i = st; i < st + k; ++i) cout << s[i].second << " ";
  cout << endl;
  return 0;
}
