PROGRAMMING:Binary search (half search)
####Description
It is known that there is an integer sequence with n elements arranged from small to large, and the data in the sequence is not repeated. Now we need to find a given value key and output the position where the key appears in the sequence.
For example: in the sequence [1,2,3,5,8,9,12,21,37,49,55613], the result of finding 5 is 4, which means that it is found, and the position is 4 (the fourth number)
####Input
The first line contains a positive integer k, indicating that there are k groups of test data. 1 <= k <= 100。 Then there are k sets of data.
For each group of data, it first contains a row of two integers, N and key, which represent the number of elements in the integer sequence of the group of data, N, and the value key to be searched（ 1 <=n<=1000)
Then, the line of the sequence contains n integers arranged from small to large, and each element of the sequence is given in turn. The adjacent two integers are separated by spaces.
The absolute value of all elements and keys in the title should not exceed 10000.
####Output
For each group of data, if there is a key in the sequence, the position where the key first appears is output; Otherwise output - 1.
Each output occupies a separate line.
####Sample input
```in
three
5 3
2 3 5 6 7
4 5
1 2 3 4
1 1
one
```
###Sample output
```out
two
-1
one
```
answer：If there is no answer, please comment
It is known that there is an integer sequence with n elements arranged from small to large, and the data in the sequence is not repeated. Now we need to find a given value key and output the position where the key appears in the sequence.
For example: in the sequence [1,2,3,5,8,9,12,21,37,49,55613], the result of finding 5 is 4, which means that it is found, and the position is 4 (the fourth number)
####Input
The first line contains a positive integer k, indicating that there are k groups of test data. 1 <= k <= 100。 Then there are k sets of data.
For each group of data, it first contains a row of two integers, N and key, which represent the number of elements in the integer sequence of the group of data, N, and the value key to be searched（ 1 <=n<=1000)
Then, the line of the sequence contains n integers arranged from small to large, and each element of the sequence is given in turn. The adjacent two integers are separated by spaces.
The absolute value of all elements and keys in the title should not exceed 10000.
####Output
For each group of data, if there is a key in the sequence, the position where the key first appears is output; Otherwise output - 1.
Each output occupies a separate line.
####Sample input
```in
three
5 3
2 3 5 6 7
4 5
1 2 3 4
1 1
one
```
###Sample output
```out
two
-1
one
```
answer：If there is no answer, please comment