#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 11;
struct Node {
  long long x, idx;
  friend bool operator<(const Node& a, const Node& b) { return a.x < b.x; }
};
Node arr[N];
long long sum[N];
long long f[N];
int n, m;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%lld", &arr[i].x), arr[i].idx = i;
  sort(arr + 1, arr + n + 1);
  for (int i = 1; i <= n; ++i) sum[i] = sum[i - 1] + arr[i].x;
  for (int i = 1; i <= n; ++i)
    f[i] = f[i - 1] + arr[i].x * (i - 1) - sum[i - 1];
  scanf("%d", &m);
  long long ans = f[m], st = m;
  for (int i = m + 1; i <= n; ++i) {
    long long tmp =
        f[i] - ((sum[i] - sum[i - m]) * (i - m) - sum[i - m] * m) - f[i - m];
    if (tmp < ans) ans = tmp, st = i;
  }
  st = st - m + 1;
  for (int i = 0; i < m; ++i) {
    printf("%d", arr[i + st].idx);
    if (i != m - 1)
      printf(" ");
    else
      printf("\n");
  }
}
