#CCBCHBAHAI0000160. Phần tử cuối cùng nhỏ hơn x (Last Element Less Than x)

Phần tử cuối cùng nhỏ hơn x (Last Element Less Than x)

Last Element Less Than x

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem Statement

Given an integer array A=(a0,a1,…,an−1)A=(a_0,a_1,\ldots,a_{n-1}) and an integer xx, find the largest 00-based index pp such that

ap<x.a_p<x.

If no element is less than xx, print -1.

Input

  • The first line contains integers nn and xx.
  • The second line contains nn integers a0,a1,…,an−1a_0,a_1,\ldots,a_{n-1}.

Output

Print the last index whose value is less than xx, or -1 if none exists.

Subtasks

Subtask 1 (100 points): 1≤n≤1051\le n\le10^5; −109≤ai,x≤109-10^9\le a_i,x\le10^9.

Examples

Input

7 5
2 8 4 7 5 1 9

Output

5

Explanation

Values below 55 occur at indices 0,2,50,2,5. The largest matching index is 55.