#include <bits/stdc++.h>

using i64 = long long;

constexpr int N = 30;

int id[N][N], cur;

void solve() {
    int n, q;
    std::cin >> n >> q;

    std::vector<int> a(n);
    for (int i = 0; i < n; i ++ ) {
        std::cin >> a[i];
    }

    const int M = 30;
    std::vector f0(n + 1, std::vector<int>(M, n));
    std::vector f1(n + 1, std::vector(M * (M + 1) / 2, n));
    for (int i = n - 1; i >= 0; i -- ) {
        for (int j = 0; j < M; j ++ ) {
            if (a[i] >> j & 1) {
                f0[i][j] = i;
            } else {
                f0[i][j] = f0[i + 1][j];
            }
        }

        for (int j = 0; j < M; j ++ ) {
            for (int k = i; k < M; k ++ ) {
                f1[i][id[j][k]] = f1[i + 1][id[j][k]];
            }
        }
        int lst = -1;
        for (int j = 0; j < M; j ++ ) {
            if (a[i] >> j & 1) {
                for (int x = lst + 1; x <= j; x ++ ) {
                    for (int y = x; y <= j; y ++ ) {
                        f1[i][id[x][y]] = i;
                    }
                }
                lst = j;
            }
        }
    }

    while (q -- ) {
        int l, r;
        std::cin >> l >> r;
        l --, r -- ;
        int t = -1;
        for (int i = M - 1; i >= 0; i -- ) {
            if (f0[l][i] <= r) {
                t = i;
                break;
            }
        }

        std::cout << (1 << t + 1) - 1 << " ";

        std::vector<int> pos;
        pos.push_back(l - 1);
        pos.push_back(r + 1);

        int os = 0;
        int sl = M, sr = -1;
        for (int i = 0; i <= t; i ++ ) {
            if (f0[l][i] <= r) {
                os |= 1 << i;
                if (f0[f0[l][i] + 1][i] > r) {
                    pos.push_back(f0[l][i]);
                }
            } else {
                sl = std::min(sl, i);
                sr = std::max(sr, i);
            }
        }
        if (sr == -1) {
            std::cout << 0 << "\n";
            continue;
        }
        std::sort(pos.begin(), pos.end());

        bool ok = 1;
        for (int i = 1; i < pos.size(); i ++ ) {
            int L = pos[i - 1], R = pos[i];
            L ++ ;
            R -- ;
            if (L > R) {
                continue;
            }
            if (f1[L][id[sl][sr]] <= R) {
                ok = 0;
                break;
            }
        }
        for (auto i : pos) {
            if (i < l || i > r) {
                continue;
            }

            int nos = os;
            for (int j = 0; j < M; j ++ ) {
                if (f0[l][j] == i && f0[i + 1][j] > r) {
                    nos ^= 1 << j;
                }
            }
            for (int j = 0; j < M; j ++ ) {
                if ((1 << j) > a[i]) {
                    break;
                }
                if ((nos | (a[i] ^ (a[i] - (1 << j)))) == (1 << t + 1) - 1) {
                    ok = 0;
                    break;
                }
            }
        }
        if (!ok) {
            std::cout << 1 << "\n";
        } else {
            std::cout << 2 << "\n";
        }
    }
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

    for (int i = 0; i < N; i ++ ) {
        for (int j = i; j < N; j ++ ) {
            id[i][j] = cur ++ ;
        }
    }

    int t;
    std::cin >> t;

    while (t -- ) {
        solve();
    }

	return 0;
}