#include <bits/stdc++.h>
using namespace std;
vector<int> G[2 * 100000 + 5];
signed long long int P[300000 + 5];
pair<signed long long int, signed long long int> A[300000 + 5];
signed long long int rangeSum(int i, int j) { return P[j] - P[i - 1]; }
int main() {
  int N, K;
  cin >> N;
  signed long long int x;
  for (int i = 1; i <= N; ++i) {
    scanf("%lld", &x);
    A[i] = make_pair(x, i);
  }
  sort(A + 1, A + N + 1);
  for (int i = 1; i <= N; ++i) {
    P[i] = P[i - 1] + A[i].first;
  }
  cin >> K;
  int L = 1;
  int R = K;
  signed long long int ans = 0;
  for (int f = -(K - 1), i = 1; i <= K; ++i, f += 2) {
    ans += A[i].first * f;
  }
  signed long long int mn = ans;
  int p = 1;
  while (R < N) {
    ans += (K - 1) * A[L].first;
    ans -= 2 * rangeSum(L + 1, R);
    ++L;
    ++R;
    ans += (K - 1) * A[R].first;
    if (ans < mn) {
      mn = ans;
      p = L;
    }
  }
  for (int i = 0; i < K; ++i) {
    printf("%d ", A[p + i].second);
  }
}
