E. Elisas Boxes
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

In the quaint village of BoxTown, Elisa, the clever organizer, has been tasked with arranging a shipment of magical artifacts. There are $$$N$$$ enchanted boxes, each with its own capacity. Elisa's goal is to fit $$$M$$$ artifacts into one of these boxes, ensuring the safety and organization of the village's treasures. Each box $$$i$$$ can hold up to $$$a_i$$$ artifacts. Elisa needs to find a box that can accommodate all $$$M$$$ artifacts. If multiple boxes can fit the artifacts, Elisa prefers the box with the smallest index to keep things tidy.

Input

The first line contains two integers $$$N$$$ and $$$M$$$ ($$$1 \leq N \leq 10^5$$$, $$$1 \leq M \leq 10^5$$$), representing the number of boxes and the number of artifacts to store, respectively. The second line contains $$$N$$$ integers $$$a_1, a_2, \ldots, a_N$$$ ($$$1 \leq a_i \leq 10^5$$$), where $$$a_i$$$ represents the capacity of the box with index $$$i$$$.

Output

Output a single integer representing the 1-based index of the box that can store all $$$M$$$ artifacts. If no such box exists, output $$$-1$$$. If multiple boxes can store the artifacts, output the index of the box with the smallest index that can store the artifacts.

Examples
Input
5 10
15 20 10 12 10
Output
1
Input
5 100
15 20 10 12 10
Output
-1