#include<bits/stdc++.h>

using namespace std;

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()

using ll = long long;

const int N = 3e5 + 5;

struct segtree {
    int R;
    vector<int> tr;

    segtree() = default;
    segtree(int n) {
        R = 1;
        while (R < n) R <<= 1;
        tr.assign(2 * R, -1);
    }

    void update(int k, int x) {
        k += R;
        tr[k] = x;
        while (k > 1) {
            k >>= 1;
            tr[k] = max(tr[k << 1], tr[k << 1 | 1]);
        }
    }

    int get(int l, int r) {
        int res = -1;
        for (l += R, r += R; l <= r; l >>= 1, r >>= 1) {
            if (l & 1) res = max(res, tr[l++]);
            if (~r & 1) res = max(tr[r--], res);
        }
        return res;
    }
};

void solve() {
    int n, q;
    cin >> n >> q;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    vector<vector<int>> pref(n + 1, vector<int>(30));
    vector<vector<int>> pos(30, vector<int>(n));
    for (int i = 0; i < n; ++i) {
        pref[i + 1] = pref[i];
        for (int j = 0; j < 30; ++j) {
            if (a[i] >> j & 1) {
                pref[i + 1][j]++;
                pos[j].push_back(i);
            }
        }
    }
    vector<vector<int>> nxt(n, vector<int>(30, -1));
    for (int i = 0; i < n; ++i) {
        if (a[i] == 0) continue;
        int cur = -1;
        for (int j = log2(a[i]); j >= 0; --j) {
            if (a[i] >> j & 1) cur = j;
            nxt[i][j] = cur;
        }
    }
    segtree trmx(n);
    for (int i = 0; i < n; ++i) {
        trmx.update(i, a[i]);
    }
    vector<segtree> trnxt(30, segtree(n));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < 30; ++j) {
            trnxt[j].update(i, nxt[i][j]);
        }
    }
    while (q--) {
        int l, r;
        cin >> l >> r;
        --l, --r;
        vector<int> cnt(30);
        for (int i = 0; i < 30; i++) {
            cnt[i] = pref[r + 1][i] - pref[l][i];
        }
        int vor = 0;
        for (int i = 0; i < 30; ++i) {
            if (cnt[i] > 0) vor |= 1 << i;
        }
        int v = trmx.get(l, r);
        for (int i = 0; 1 << i <= v; ++i) v |= 1 << i;
        cout << v << ' ';
        if (vor == v) {
            cout << "0";
        } else {
            int vl = 1e9, vr = -1;
            for (int i = 0; i < 30; ++i) {
                if (cnt[i] == 0) {
                    vl = min(vl, i);
                    vr = max(vr, i + 1);
                }
            }
            for (int i = 0; i < 30; ++i) {
                if (vl <= i && i <= vr) continue;
                if (cnt[i] > 1) continue;
                int k = *lower_bound(all(pos[i]), l);
                trnxt[vl].update(k, -1);
            }
            if (trnxt[vl].get(l, r) >= vr) {
                cout << "1";
            } else {
                cout << "2";
            }
            for (int i = 0; i < 30; ++i) {
                if (vl <= i && i <= vr) continue;
                if (cnt[i] > 1) continue;
                int k = *lower_bound(all(pos[i]), l);
                trnxt[vl].update(k, nxt[k][vl]);
            }
        }
        cout << '\n';
    }
}

int main() {
#ifndef LOCAL
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#else
    freopen("input.txt", "r", stdin);
#endif
    int t;
    cin >> t;
    while (t--)
    solve();
    return 0;
}