Cafeteria Queue

Problem Description

There are $n$ students waiting in line for food. The $i$-th student stands at the $i$-th position from the front. The serving window serves one portion to the student at the front of the queue each time; after receiving the food, that student immediately goes to the back of the queue. The $i$-th student needs $a_i$ portions to be full; once full, he immediately leaves the queue and no longer waits.

Find the state of the queue after a total of $k$ portions have been served.

Input Format

The first line contains two integers $n, k$.

The second line contains $n$ integers $a_1, a_2, \dots, a_n$.

Output Format

If fewer than $k$ portions can be served, output -1; otherwise output the indices of the students still in the queue, ordered from front to back, separated by spaces.

Sample Input 1

3 3
1 2 1

Sample Output 1

2

Sample Input 2

4 10
3 3 2 1

Sample Output 2

-1

Sample Input 3

7 10
1 3 3 1 2 3 1

Sample Output 3

6 2 3

Constraints

• $1\le n\le 10^5$
• $0\le k\le 10^{14}$
• $1\le a_i\le 10^9$