Recently, the six friends - Monica, Chandler, Rachel, Ross, Joey and Phoebe - have decided to go on another trip to the beach house to meet Phoebe's mother.

Now it often happens that Joey feels left out whenever the group of friends start to discuss something which they learnt during high school. Apparently, Joey didn't really study in high school, as he was busy doing other things.

But this time Joey has decided to stay prepared. He has bought all the encyclopaedias - and he is determined to study them so that he doesn't feel left out. But Joey is really really lazy, and so he decides to study only as much as he thinks will be discussed at the beach house.

He has a the set of the books arranged in no specific manner. Given the level of book he has to study, he has to decide which is the position of the next smallest book he has to study from the given level. Help him to get this position.

Input

First line contains number of test cases T. The first line of each testcase contains a positive integer N - the number of encyclopaedias. The second line contains N space-separated positive integers l_i representing the level of encyclopaedia at the ith position. Note that there can be many encyclopaedias with same level. The last line contains a positive number L which denotes the level of encyclopaedia just above the one Joey has to read.

Output

Output a single positive number pointing to the maximum position i of the encyclopaedia just below the level Joey has to read. In case, the level doesn't exist, output -1.

Constraints

0 < t <= 10

0 < n <= 100000

0 < l_i, L <= 10000000000 (10 ^ 10)