#include <bits/stdc++.h>
const long double PI = 3.141592653589793238L;
const long long N = 300005;
using namespace std;
long long t[N], s[N];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n;
  cin >> n;
  pair<long long, long long> a[n + 1];
  for (long long i = (long long)(1); i <= (long long)(n); ++i)
    cin >> a[i].first, a[i].second = i;
  long long k;
  cin >> k;
  sort(a + 1, a + n + 1);
  for (long long i = (long long)(1); i <= (long long)(n); ++i)
    t[i] = t[i - 1] + a[i].first * (i - 1) - s[i - 1],
    s[i] = s[i - 1] + a[i].first;
  long long ans, best;
  for (long long i = (long long)(1); i <= (long long)(n - k + 1); ++i) {
    long long t_ans = t[i + k - 1] - t[i - 1];
    t_ans -= (s[i + k - 1] - s[i - 1]) * (i - 1) - s[i - 1] * k;
    if (i == 1 || t_ans < ans) ans = t_ans, best = i;
  }
  for (long long i = (long long)(best); i <= (long long)(best + k - 1); ++i)
    cout << a[i].second << " ";
  return 0;
}
