You are given an array a of n integers, and q queries. Each query is represented by two integers l and r ( 1 <= l <= r <= n ). Your task is to find, for each query, two indices i and j (or determine that they do not exist) such that: In other words, for each query, you need to find a pair of different elements among a_l, a_{l+1}, ... , a_r , or report that such a pair does not exist. The first line of the input contains a single integer t ( 1 <= t <= 10^4 ) -- the number of test cases. The descriptions of the test cases follow. The first line of each test case contains a single integer n ( 2 <= n <= 2 cdot 10^5 ) -- the length of the array a . The second line of each test case contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= 10^6 ) -- the elements of the array a . The third line of each test case contains a single integer q ( 1 <= q <= 2 cdot 10^5 ) -- the number of queries. The next q lines contain two integers each, l and r ( 1 <= l < r <= n ) -- the boundaries of the query. It is guaranteed that the sum of the values of n across all test cases does not exceed 2 cdot 10^5 . Similarly, it is guaranteed that the sum of the values of q across all test cases does not exceed 2 cdot 10^5 . For each query, output two integers separated by space: i and j ( l <= i, j <= r ), for which a_i ne a_j . If such a pair does not exist, output i=-1 and j=-1 . You may separate the outputs for the test cases with empty lines. This is not a mandatory requirement.