Reading（CF-234B）

Problem Description

Vasya 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 ai (0 ≤ ai ≤ 100), ai 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 b1, b2, ..., bk, — the indexes of hours Vasya will read at (1 ≤ bi ≤ n). The hours are indexed starting from 1. If there are multiple optimal solutions, print any of them. Print the numbers bi 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.

题意：有一盏灯，有 n 个小时，每个小时有一个亮度，现在要选择 k 个小时进行读书，要选择亮度最大的前 k 个，输出选择的里面最小的那个，并将选择的小时序号输出

思路：记录每个灯的亮度与序号，第一次按亮度降序排序选前 k 个，首先输出第 k 个，然后再将这 k 个的序号暂存起来进行第二次排序，第二次排序时按序号升序排序，然后输出即可

此外，注意本题要使用文件读写

Source Program

#include<bits/stdc++.h>
#define Exp 1e-9
#define PIacos(-1.0)
#define INF 0x3f3f3f3f
#define LL long long
const int MOD = 1E9+7;
const int N = 10000+5;
const int dx[] = {-1,1,0,0,-1,-1,1,1};
const int dy[] = {0,0,-1,1,-1,1,-1,1};
using namespace std;
struct Node{
    int num;
    int id;
    bool operator <(const Node &rhs)const{
        return num>rhs.num;
    }
}a[N];
int res[N];
int main(){
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    int n,k;
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i].num);
        a[i].id=i;
    }
    sort(a+1,a+1+n);

    printf("%d\n",a[k].num);
    for(int i=1;i<=k;i++)
        res[i]=a[i].id;

    sort(res+1,res+1+k);
    for(int i=1;i<=k;i++)
        printf("%d ",res[i]);
    printf("\n");

    return 0;
}