Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only 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

The problem statement has recently been changed. View the changes.

×
B. Reading

time limit per test

1 secondmemory limit per test

256 megabytesinput

input.txtoutput

output.txtVasya is going to the Olympics in the city Ntown by train. The boy wants to read the textbook to prepare for the Olympics. He counted that he needed *k* hours for this. He also found that the light in the train changes every hour. The light is measured on a scale from 0 to 100, where 0 is very dark, and 100 is very light.

Vasya has a train lighting schedule for all *n* hours of the trip — *n* numbers from 0 to 100 each (the light level in the first hour, the second hour and so on). During each of those hours he will either read the whole time, or not read at all. He wants to choose *k* hours to read a book, not necessarily consecutive, so that the minimum level of light among the selected hours were maximum. Vasya is very excited before the upcoming contest, help him choose reading hours.

Input

The first input line contains two integers *n* and *k* (1 ≤ *n* ≤ 1000, 1 ≤ *k* ≤ *n*) — the number of hours on the train and the number of hours to read, correspondingly. The second line contains *n* space-separated integers *a*_{i} (0 ≤ *a*_{i} ≤ 100), *a*_{i} is the light level at the *i*-th hour.

Output

In the first output line print the minimum light level Vasya will read at. In the second line print *k* distinct space-separated integers *b*_{1}, *b*_{2}, ..., *b*_{k}, — the indexes of hours Vasya will read at (1 ≤ *b*_{i} ≤ *n*). The hours are indexed starting from 1. If there are multiple optimal solutions, print any of them. Print the numbers *b*_{i} in an arbitrary order.

Examples

Input

5 3

20 10 30 40 10

Output

20

1 3 4

Input

6 5

90 20 35 40 60 100

Output

35

1 3 4 5 6

Note

In the first sample Vasya should read at the first hour (light 20), third hour (light 30) and at the fourth hour (light 40). The minimum light Vasya will have to read at is 20.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/04/2021 03:46:33 (h1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|