Kanade has an array a[1..n] , she define that an array b[1..m] is good if and only if it satisfy the following conditions: 1 b[i] a[b[i]] m0 Now you need to find the k-th smallest lexicographically good array.

输入描述:

The first line has two integer n,kThe second line has n integer a[i]

输出描述:

If there is no solution, just only output -1, else output two lines, the first line has an integer m, the second line has m integer b[i]

备注:

111=a[i]=10^9