#include <bits/stdc++.h>
using namespace std;
const long long N = 3e5 + 7;
int n, k;
struct Point {
  long long x, id;
};
Point a[N];
int cmp(const Point p1, const Point p2) { return p1.x < p2.x; }
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &a[i].x);
    a[i].id = i;
  }
  sort(a + 1, a + n + 1, cmp);
  scanf("%d", &k);
  long long ans = k;
  double ansdis = 1e18, tmp = 0, sum = 0;
  for (int i = 1; i <= k; i++) {
    sum += a[i].x;
    tmp += i * a[i].x - sum;
  }
  ansdis = tmp;
  for (int i = k + 1; i <= n; i++) {
    tmp -= sum - k * a[i - k].x;
    sum -= a[i - k].x;
    sum += a[i].x;
    tmp += k * a[i].x - sum;
    if (ansdis >= tmp) {
      ansdis = tmp;
      ans = i;
    }
  }
  for (int i = ans - k + 1; i <= ans; i++) {
    printf("%lld%c", a[i].id, " \n"[i == ans]);
  }
  return 0;
}
