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 ≤ 10^{7}

0 ≤ A_{i} ≤ 10^{8}

1 ≤ K ≤ 10^{8}

**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.

surya jeet singh | 205 |

tech_devil | 188 |

mvsaichaitanya | 164 |

shubham001 | 137 |

Utkarsh_chaudhary | 127 |

Anurag_Singh | 677 |

satyam singh 9 | 550 |

dev_v2 | 528 |

Aman Patel | 478 |

FortisFortunaAdiuvat | 472 |

akhayrutdinov | 4777 |

Quandray | 4050 |

sanjay05 | 3668 |

Ibrahim Nash | 3664 |

surbhi_7 | 2816 |