#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int INF = 2e9;
const long long INF64 = 9e18;
const long double EPS = 1e-9;
const long double PI = 3.14159265358979310000;
const int N = 300001;
const int M = 12001;
long long n, k, sum[N];
pair<long long, long long> a[N];
int main() {
  cin >> n;
  for (int i = 0; i < int(n); i++) {
    scanf("%I64d", &a[i].first);
    a[i].first += INF;
    a[i].second = i + 1;
  }
  sort(a, a + n);
  sum[0] = a[0].first;
  for (int i = 1; i < n; i++) sum[i] = sum[i - 1] + a[i].first;
  cin >> k;
  long long a1 = 0, b1 = k - 1, ss = 0;
  for (int i = 0; i < int(k); i++) {
    ss += sum[k - 1] - sum[i] - a[i].first * (k - i - 1);
  }
  long long q = ss;
  for (int i = k; i < n; i++) {
    ss -= sum[i - 1] - sum[i - k] - a[i - k].first * (k - 1);
    ss += a[i].first * (k - 1) - sum[i - 1] + sum[i - k];
    if (ss < q) {
      q = ss;
      a1 = i - k + 1;
      b1 = i;
    }
  }
  for (int i = a1; i <= b1; i++) printf("%I64d ", a[i].second);
  return 0;
}
