#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const long long _INF = 0xc0c0c0c0c0c0c0c0;
const long long mod = (int)1e9 + 7;
const int N = 3e5 + 100;
int x[N];
int p[N];
bool cmp(int a, int b) { return x[a] < x[b]; }
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", &x[i]), p[i] = i;
  sort(p + 1, p + 1 + n, cmp);
  int k;
  scanf("%d", &k);
  long long ans = 0, sum = 0, sz = 0;
  int l = 1, r = k;
  for (int i = 1; i <= k; ++i) {
    ans += 1ll * sz * x[p[i]] - sum;
    sz++;
    sum += x[p[i]];
  }
  long long now = ans;
  for (int i = 2; i + k - 1 <= n; ++i) {
    sum -= x[p[i - 1]];
    now -= sum - (k - 1ll) * x[p[i - 1]];
    now += (k - 1ll) * x[p[i + k - 1]] - sum;
    sum += x[p[i + k - 1]];
    if (now < ans) {
      ans = now;
      l = i;
      r = i + k - 1;
    }
  }
  for (int i = l; i <= r; ++i) printf("%d%c", p[i], " \n"[i == r]);
  return 0;
}
