#include<bits/stdc++.h>
using namespace std;
#define nl "\n"
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ull unsigned ll
#define RV  return void
#define inf 2000000000
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define Mini(x) *min_element(all(x))
#define Maxi(x) *max_element(all(x))
#define fixed(n) fixed << setprecision(n)
#define ceil(w, m) (((w) / (m)) + ((w) % (m) ? 1 : 0))
#define cin(v) for (auto&i:v) cin >> i;
#define cout(v) for (auto&i:v) cout << i << " ";
#define clr(memo, x) memset(memo, x, sizeof memo)
#define updmin(a, b) a = min(a, b)
#define updmax(a, b) a = max(a, b)
#define vi vector < int >
#define vl vector < ll >
#define vc vector < char >
#define vs vector < string >
#define v2i vector < vector < int > >
#define v2l vector < vector < int > >
#define seti set < int >
#define setl set < ll >
#define mapii map < int , int >
#define mapll map < ll , ll >
#define mapli map < ll , int >
#define mapci map < char , int >
#define mapsi map < string , int >
#define pll pair < ll , ll >
#define pii pair < int , int >
#define range(l,r,x) for(int i=l ; i < r ; i+=x)
#define FastCode ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
vector < string > ternary= {"NO\n" , "YES\n"};

void  Zainab(){
            #ifndef ONLINE_JUDGE
              freopen("input.txt", "r", stdin);
              freopen("output.txt", "w", stdout);
            #endif
}


/*================================  solution  ================================ */



void myCode(){

ll n ;
cin >> n ;
vector < ll > v ( n+1 );
for(int i =1 ; i <= n ; i++){
    cin >> v[i];
}



vector < vector < ll > > pref ( n+1 , vector < ll > (35 , 0) );


for(int i = 1 ; i <= n ; i++){
    for(int j = 0 ; j < 32 ; j++){
        pref[i][j] = pref[i-1][j] + (v[i] & (1<<j));
    }
}



ll q;   cin >> q;
while(q--){
    ll l , k;
    cin >> l >> k ;

    ll start = l , end = n , r = -1;

    while(start <= end){
        ll mid = start + (end - start) / 2 ,  sum =0;
        for(int i = 0 ; i < 32 ; i++){
            if(pref[mid][i] - pref[l-1][i] == mid - l + 1){
                sum += (1<<i);
            }
        }

        if(sum >= k )
            start = mid +1  ,   r = mid ;
        else
            end = mid -1;

    }
    cout << r << " ";


}

    cout << nl;

}


int main(){
                                   FastCode ;
                                    // Zainab() ;





        int testCase=1;
             cin >> testCase ;
        for(int i=1 ; i<= testCase ; i++){
            myCode();
        }


    return 0;
}