K Best#5370
Demy has jewels. Each of her jewels has some value v_i and weight w_i.
Since her husband John got broke after recent financial crises, Demy has decided to sell some jewels. She has decided that she would keep best jewels for herself.
She decided to keep such jewels that their specific value is as large as possible. That is, denote the specific value of some set of jewels S = \{i_1, i_2, ..., i_k\} as
Demy would like to select such jewels that their specific value is maximal possible. Help her to do so.
The first line of the input file contains - the number of jewels Demy got, and - the number of jewels she would like to keep (1 \le k \le n \le 100000). The following lines contain two integer numbers each - v_i and w_i (0 \le v_i \le 10^6, 1 \le w_i \le 10^6, both the sum of all v_i and the sum of all w_i do not exceed 10^7).
Output numbers - the numbers of jewels Demy must keep. If there are several solutions, output any one.
Example 1