Given a sorted and rotated array A of N distinct elements which is rotated at some point, and given an element K. The task is to find the index of the given element K in the array A.
Input:
The first line of the input contains an integer T, denoting the total number of test cases. Then T test cases follow. Each test case consists of three lines. First line of each test case contains an integer N denoting the size of the given array. Second line of each test case contains N space separated integers denoting the elements of the array A. Third line of each test case contains an integer K denoting the element to be searched in the array.
Output:
Corresponding to each test case, output the index of the element found in the array. If element is not present, then output -1.
Constraints:
1 ≤ T ≤ 100
1 ≤ N ≤ 107
0 ≤ Ai ≤ 108
1 ≤ K ≤ 108
Example:
Input:
3
9
5 6 7 8 9 10 1 2 3
10
3
3 1 2
1
4
3 5 1 2
6
Output:
5
1
-1
Explanation:
Testcase 1: 10 is found at index 5.
| lakshmi_pandey | 72 |
| abbatta7 | 68 |
| Ashish Kumar Vaishy | 62 |
| aman19 | 58 |
| Kumar Gaurav Singh | 58 |
| saumitra13325 | 612 |
| ashujack | 551 |
| lakshmi_pandey | 544 |
| aman19 | 538 |
| piyushmittal25 | 514 |
| blackshadows | 5249 |
| akhayrutdinov | 5111 |
| Ibrahim Nash | 5087 |
| Quandray | 4354 |
| sanjay05 | 3668 |