本翻译不再进行维护。 This translation will no longer be maintained.

Background

The preliminary round of the 2025 CSP has been completed, and the results have been released.

Problem Description

$FISH$ performed poorly in the preliminary exam and is very upset. Comparing himself to the people from RTY only makes him feel even more depressed. Seeing this, the kind-hearted you decides to comfort FISH. Currently, $FISH$'s comfort score is $x$, and FISH gives you $n$ chances. Each chance allows you to provide a comfort score of $a[i]$, as long as it is greater than or equal to $x$, $FISH$ will be comforted. Now, please output the number of the first time you can comfort FISH.

Input and Output

Input

Two lines in total The first line contains two positive integers $n$ and $x$; The second line contains $n$ increasing integers $a[i]$

Output

Line 1: Find the sequence of numbers that meet the criteria
Line 2: Output the value If no qualifying number is found, output "Not found!"

Example

10 66
10 25 52 62 66 66 66 85 87 95

8

Data Range

1s, 1024KiB. $1<=N<=2000000$,$x>0$,$a[i]>0$