#include <bits/stdc++.h>
using namespace std;
const int INF = 2000000000;
long long l[300300], r[300300];
pair<int, int> a[300300];
int n, k;
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a[i].first);
    a[i].second = i + 1;
  }
  scanf("%d", &k);
  sort(a, a + n);
  l[0] = r[n - 1] = 0;
  for (int i = 1; i < k; ++i) l[0] += a[i].first - a[0].first;
  for (int i = 1; i <= n - k; ++i)
    l[i] = l[i - 1] - 1ll * (k - 1) * (a[i].first - a[i - 1].first) +
           a[i + k - 1].first - a[i].first;
  for (int i = n - k; i < n - 1; ++i) r[n - 1] += a[n - 1].first - a[i].first;
  for (int i = n - 2; i >= k - 1; --i)
    r[i] = r[i + 1] - 1ll * (k - 1) * (a[i + 1].first - a[i].first) +
           a[i].first - a[i - k + 1].first;
  long long s, cur;
  s = cur = l[0];
  for (int i = 1; i < k; ++i)
    cur -= 1ll * (k - i) * (a[i].first - a[i - 1].first), s += cur;
  int ans = 0;
  cur = s;
  for (int i = 0; i < n - k; ++i) {
    cur += r[i + k] - l[i];
    if (cur < s) s = cur, ans = i + 1;
  }
  for (int i = ans; i < ans + k; ++i) printf("%d ", a[i].second);
  return 0;
}
