Hogwarts Exam Ranking

23 Oct 2026

Easy 1 s 256 MBbinary search

Harry Potter and his classmates just finished their exams at Hogwarts. The scores of all $N$ students are published on the wall in strictly increasing order (no duplicate marks).

Harry knows his exact score $X$ , and his score is guaranteed to be somewhere in the list. He wants to find his exact 1-based position (rank) on the list so he knows where he stands among his peers.

Given $N$ and Harry's score $X$ on the first line, and the strictly increasing list of student scores on the second line, help him find his position using binary search.

Input

The first line contains two integers $N$ and $X$ ( $1 \le N \le 2 \times 10^5$ , $0 \le X \le 10^9$ ) — the number of students and Harry's score.

The second line contains $N$ space-separated integers $a_1, a_2, \dots, a_N$ ( $0 \le a_i \le 10^9$ ) — the student scores in strictly increasing order. It is guaranteed that $X$ exists in the list.

Output

Print a single integer — the 1-based position (rank) of Harry's score in the list.

Hogwarts Exam Ranking

Input

Output

Examples