Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E. Subway Innovation

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputBerland is going through tough times — the dirt price has dropped and that is a blow to the country's economy. Everybody knows that Berland is the top world dirt exporter!

The President of Berland was forced to leave only *k* of the currently existing *n* subway stations.

The subway stations are located on a straight line one after another, the trains consecutively visit the stations as they move. You can assume that the stations are on the *Ox* axis, the *i*-th station is at point with coordinate *x*_{i}. In such case the distance between stations *i* and *j* is calculated by a simple formula |*x*_{i} - *x*_{j}|.

Currently, the Ministry of Transport is choosing which stations to close and which ones to leave. Obviously, the residents of the capital won't be too enthusiastic about the innovation, so it was decided to show the best side to the people. The Ministry of Transport wants to choose such *k* stations that minimize the average commute time in the subway!

Assuming that the train speed is constant (it is a fixed value), the average commute time in the subway is calculated as the sum of pairwise distances between stations, divided by the number of pairs (that is ) and divided by the speed of the train.

Help the Minister of Transport to solve this difficult problem. Write a program that, given the location of the stations selects such *k* stations that the average commute time in the subway is minimized.

Input

The first line of the input contains integer *n* (3 ≤ *n* ≤ 3·10^{5}) — the number of the stations before the innovation. The second line contains the coordinates of the stations *x*_{1}, *x*_{2}, ..., *x*_{n} ( - 10^{8} ≤ *x*_{i} ≤ 10^{8}). The third line contains integer *k* (2 ≤ *k* ≤ *n* - 1) — the number of stations after the innovation.

The station coordinates are distinct and not necessarily sorted.

Output

Print a sequence of *k* distinct integers *t*_{1}, *t*_{2}, ..., *t*_{k} (1 ≤ *t*_{j} ≤ *n*) — the numbers of the stations that should be left after the innovation in arbitrary order. Assume that the stations are numbered 1 through *n* in the order they are given in the input. The number of stations you print must have the minimum possible average commute time among all possible ways to choose *k* stations. If there are multiple such ways, you are allowed to print any of them.

Examples

Input

3

1 100 101

2

Output

2 3

Note

In the sample testcase the optimal answer is to destroy the first station (with *x* = 1). The average commute time will be equal to 1 in this way.

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/19/2019 23:00:47 (d2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|