#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int s[N][31];
int main() {
    #ifdef _DEBUG
        freopen("data.txt", "r", stdin);
    #endif
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;
    cin >> T;
    while(T--) {
    int n, Q;
    cin >> n >> Q;
    vector<int> a(n + 1, 0);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        for (int j = 0; j < 30; j++) 
            s[i][j] = s[i - 1][j] + ((a[i] >> j) & 1);
    }
    while(Q--){
        int l, r;
        cin >> l >> r;
        if(l == r) {
            cout << a[l] << "\n";
            continue;
        }
        int cnt[30];
        for(int i = 29; i >= 0; i--) 
            cnt[i] = s[r][i] - s[l - 1][i];
        int ans = 0;
        int pre = 0, num = 0;
        int flag = 1;
        for(int i = 29; i >= 0; i--) {
            if (cnt[i] >= 2) {
                ans += (1 << (i + 1)) - 1;
                break;
            }
            if (cnt[i] == 1) ans += (1 << i);
        }
        cout << ans << " ";
        for (int i = 0; (1 << i) <= ans; i++) {
            if (cnt[i]) {
                if(pre != i) num++;
                pre = i + 1;
            } else {
                flag = 0;
            }
        }
        if(((ans + 1) & (- (ans + 1))) == ans + 1 && num > 1) cout << "2\n"; 
        else if(flag == 1) cout << "0\n";
        else cout << "1\n";
        }
    }
}