Stop at the First Value Above Threshold

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem Statement

Given threshold $T$ and a sequence of $n$ integers, print the first value strictly greater than $T$, not its position. Print NONE if absent. Values after the first match do not affect the answer.

Input

The first line contains $n,T$, then exactly $n$ integers. $-10^6\le T,a_i\le10^6$.

Output

The first value satisfying $a_i>T$, or NONE.

Subtasks

• Subtask 1 (20%): $0\le n\le 8$; $-10^6\le a_i\le10^6$.

• Subtask 2 (30%): $0\le n\le 1000$; $-10^6\le a_i\le10^6$.

• Subtask 3 (50%): $0\le n\le 100000$; $-10^6\le a_i\le10^6$.

Examples

Example 1

Input:

5 6
1 6 7 9 10

Output:

7

Explanation:

Equality does not qualify; return the first strictly greater value.

Example 2

Input:

3 -2
-5 -2 0

Output:

0

Explanation:

Equality does not qualify; return the first strictly greater value.