**Compilation/Execution Result:**

41.92%

Given an unsorted array Arr[] of N integers and a Key which is present in this array. You need to write a program to find the **start index**( index where the element is first found from left in the array ) and **end index**( index where the element is first found from right in the array ).

**Input:**

Fisrt line of input contains an integer T which denotes the number of test cases. First line of each test case contains a single integer N which denotes the number of elements in the array. Second line of each test case contains N space separated integers. Third line of each test case contains the key to be searched.

**Output:**

For each test case print two space separated integeres, first is the start index and second is the end index. If the key doesnot exist in the array then print -1 in this case.

**Constraints:**

1<=T<=100

1<=N<=10^{5}

1<=Arr[i]<=10^{4}

**Example:
Input:**

2

6

1 2 3 4 5 5

5

6

6 5 4 3 1 2

4

4 5

2 2

Author: harsh.agarwal0

dauntless | 84 |

rksingh | 74 |

iharshitmittal | 74 |

sj5331 | 69 |

madhumitha d rao | 66 |

Shashank_Pathak | 636 |

dark_knights | 560 |

surbhi_7 | 556 |

SANJAY5797 | 359 |

rksingh | 358 |

akhayrutdinov | 4159 |

sanjay05 | 3611 |

Quandray | 2829 |

Ibrahim Nash | 2501 |

Michael Riegger | 2296 |