F. Fair Prize
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

John is at the fair and has finally won a prize in the marble game. In the prize selection, there are $$$n$$$ different prizes arranged in a row, each of the $$$n$$$ prizes has a label $$$v_i$$$ ($$$1 \leq i \leq N$$$) that represents the value of the prize. John has scored $$$p$$$ points in the marble game, and, according to the marble game rules, he can select a prize that has a value less than or equal to $$$p$$$.

Given the values of the $$$n$$$ prizes, can you help John select the prize with the highest value that he can choose?

Input

The first line of input contains two integer numbers separated by a space, $$$n$$$ ($$$1 \leq n \leq 1000$$$) and $$$p$$$ ($$$1 \leq p \leq 1000$$$), representing the number of prizes in the marble game and the amount of points John scored in the game, respectively.

The second and last line of input contains $$$n$$$ integer numbers separated by a space, where the $$$i$$$-th number represents the value $$$v_i$$$ ($$$1 \leq v_i \leq 1000$$$) of the $$$i$$$-th prize.

Output

Output a line with a single integer number, the value of the prize with the highest value that John can choose. It is guaranteed that John will always be able to select a prize.

Examples
Input
5 10
4 2 4 3 9
Output
9
Input
1 10
10
Output
10
Input
3 6
6 2 4
Output
6