#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define SZ(a) ((int)a.size())
#define ALL(v) v.begin(), v.end()
#define pb push_back

const int L = 30;
int arr[100005], cnt[100005][L], qcnt[100005][L];
pii ans[100005], ud[100005];
vector<pii> query[100005];
deque<int> dq[L][L];

void solve() {
    int n, q;
    cin >> n >> q;
    for (int i = 1; i <= n; ++i) query[i].clear();
    for (int i = 0; i < L; ++i)
        for (int j = 0; j < L; ++j)
            dq[i][j].clear();
    for (int i = 1; i <= n; ++i)
        cin >> arr[i];
    for (int i = 1; i <= n; ++i) {
        for (int j = 0; j < L; ++j) {
            cnt[i][j] = cnt[i - 1][j];
            if (arr[i] >> j & 1) ++cnt[i][j];
        }
    }
    for (int i = 1; i <= q; ++i) {
        int l, r;
        cin >> l >> r;
        ud[i] = pii(-1, -1);
        for (int j = 0; j < L; ++j)
            qcnt[i][j] = cnt[r][j] - cnt[l - 1][j];
        for (int j = L - 1; j >= 0; --j)
            if (qcnt[i][j] > 0) {
                ans[i].X = (1 << (j + 1)) - 1;
                break;
            }
        if (ans[i].X == 0) continue;
        for (int j = __lg(ans[i].X); j >= 0; --j) {
            if (qcnt[i][j] == 0) {
                if (!~ud[i].X) ud[i].X = j;
                ud[i].Y = j;
            }
        }
        if (~ud[i].X) {
            ans[i].Y = 2;
            query[r].pb(pii(l, i));
        }
    }

    for (int i = 1; i <= n; ++i) {
        for (int j = 0; j < L; ++j)
            if (arr[i] > (1 << j))
                for (int k = j; k >= 0; --k) {
                    if ((arr[i] >> k & 1) == 0) {
                        dq[k][j].pb(i);
                        if (SZ(dq[k][j]) > L + 5) dq[k][j].pop_front();
                    }
                    else break;
                }
        for (auto [l, idx] : query[i]) {
            for (int j : dq[ud[idx].Y][ud[idx].X])
                if (j >= l) {
                    for (int k = 0; k < L; ++k)
                        qcnt[idx][k] -= arr[j] >> k & 1;
                    int tmp = arr[j] ^ (arr[j] - (1 << ud[idx].Y));
                    for (int k = 0; k < L; ++k)
                        if (qcnt[idx][k])
                            tmp |= 1 << k;
                    if (tmp == ans[idx].X) ans[idx].Y = 1;
                    for (int k = 0; k < L; ++k)
                        qcnt[idx][k] += arr[j] >> k & 1;
                }
        }
    }

    for (int i = 1; i <= q; ++i)
        cout << ans[i].X << " " << ans[i].Y << "\n";
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}