#include<bits/stdc++.h>

using namespace std;

int const maxn = 1e5 + 5, maxb = 30;
int a[maxn];
int nxt[maxn][maxb];
int cur[maxb][maxn];
int jump[maxb][maxn];

main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, q, l, r, t;
    cin >> t;
    while (t--) {
        cin >> n >> q;
        for (int i = 1; i <= n; i++) cin >> a[i];
        for (int j = 0; j < maxb; j++) nxt[n + 1][j] = n + 1;
        for (int i = n; i >= 1; i--) {
            for (int j = 0; j < maxb; j++) {
                if ((a[i]>>j)&1) nxt[i][j] = i;
                else nxt[i][j] = nxt[i + 1][j];
            }
        }
        for (int i = 1; i <= n; i++) {
            int b = 0;
            for (int j = 0; j < maxb; j++) cur[j][i] = -1;
            while (b < maxb) {
                if ((a[i]>>b)&1) {
                    b++;
                    continue;
                }
                int now = b;
                while (now < maxb && ((a[i]>>now)&1) == 0) {
                    now++;
                }
                if (now != maxb) {
                    for (int j = b; j < now; j++) cur[j][i] = now - 1;
                }
                b = now;

            }
        }
        for (int j = 0; j < maxb; j++) {
            for (int i = n; i >= 1; i--) {
                jump[j][i] = i + 1;
                while (jump[j][i] <= n && cur[j][jump[j][i]] <= cur[j][i]) jump[j][i] = jump[j][jump[j][i]];
            }
        }
        for (int i = 1; i <= q; i++) {
            cin >> l >> r;
            int value = 0;
            for (int j = 0; j < maxb; j++) {
                if (nxt[l][j] <= r) value |= (1 << j);
            }
            int x = 1;
            while (x <= value) x *= 2;
            if (x - 1 == value) {
                cout << value << " " << 0 << '\n';
                continue;
            }
            int imin = maxb, imax = 0;
            for (int j = 0; j < maxb && (1 << j) <= value; j++) {
                if ((value>>j)&1) continue;
                imin = min(imin, j), imax = j;
            }
            int pos = l;
            while (jump[imin][pos] <= r) pos = jump[imin][pos];
            if (cur[imin][pos] >= imax) cout << x - 1 << " " << 1 << '\n';
            else cout << x - 1 << " " << 2 << '\n';
        }
    }
    return 0;
}