#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int s[N][31], f[N][31];
int lg[N], R[N][20][31];
void init(int n) {
    for(int i = 2; i <= n; i++) lg[i] = lg[i >> 1] + 1;
    for(int k = 0; k < 30; k++) {
        for (int i = 1; i <= n; i++) R[i][0][k] = f[i][k];
        for (int j = 1; j < 20; j++)
            for(int i = 1; i + (1 << j) - 1 <= n; i ++)
                R[i][j][k] = min(R[i][j - 1][k], R[i + (1 << (j - 1))][j - 1][k]);
    }
}
int ask(int l, int r, int i) {
    int t = lg[r - l + 1];
    return min(R[l][t][i], R[r - (1 << t) + 1][t][i]);
}
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];
            int pre = 0;
            for (int j = 0; j < 30; j++) {
                int d = ((a[i] >> j) & 1);
                s[i][j] = s[i - 1][j] + d;
                if (d) {
                    f[i][j] = pre;
                    pre = j + 1;
                } else f[i][j] = 1e9;
            }
        }
        init(n);
        while(Q--){
            int l, r;
            cin >> l >> r;
            if(l == r) {
                cout << a[l] << " 0\n";
                continue;
            }
            int cnt[30];
            for(int i = 29; i >= 0; i--) 
                cnt[i] = s[r][i] - s[l - 1][i];
            int ans = 0;
            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 << " ";
            int mi = 1e9, ma = 0;
            for (int i = 0; (1 << i) <= ans; i++) {
                if (cnt[i] == 0 && ((ans >> i) & 1) == 1) {
                    mi = min(i, mi);
                    ma = max(i, ma);
                }
            }
            if(mi == 1e9) cout << "0\n";
            else {
                int flag = 2;
                for (int i = ma + 1; (1 << i) <= ans; i++) {
                    if(cnt[i] >= 2 && ask(l, r, i) <= mi) {
                        flag = 1;
                        break;
                    } 
                }
                cout << flag << "\n";
            }
        }
    }
}
/*

*/