#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cstring>
#include <string>
#include <unordered_map>
#include <cmath>
#include <assert.h>

template <typename Tp>
inline void read(Tp &x) {
    x = 0;
    bool f = true; char ch = getchar();
    for ( ; ch < '0' || ch > '9'; ch = getchar()) f ^= ch == '-';
    for ( ; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + (ch ^ 48);
    x = f ? x : -x;
}

const int N = 1e5, M = 465, K = 30;

int a[N + 5], sum[N + 5][M + 5], lst[N + 5][K + 5], sum1[N + 5][K + 5], s[M + 5], s1[K + 5];
bool vis[N + 5];

int id(int x, int y) {
    if (y < x) return -1;
    return (2 * K - (x - 1)) * x / 2 + y - x;
}

int main() {
    int T;
    read(T);
    while (T--) {
        int n, q;
        read(n), read(q);
        for (int i = 1; i <= n; ++i) {
            read(a[i]);
            memcpy(sum[i], sum[i - 1], sizeof(sum[i]));
            memcpy(sum1[i], sum1[i - 1], sizeof(sum1[i]));
            int cur = -1;
            for (int j = 0; j < K; ++j) {
                if ((a[i] & (1 << j)) == 0) continue;
                lst[i][j] = i;
                ++sum[i][id(cur + 1, j)];
                ++sum1[i][j];
                cur = j;
            }
        }
        while (q--) {
            int l, r;
            read(l), read(r);
            for (int i = 0; i < M; ++i) s[i] = sum[r][i] - sum[l - 1][i];
            for (int i = 0; i < K; ++i) s1[i] = sum1[r][i] - sum1[l - 1][i];
            std::vector<int> Vec;
            int L = -1, R = -1, ans = 0, m = -1;
            for (int i = 0; i < K; ++i) {
                if (!s1[i]) continue;
                ans = (1 << (i + 1)) - 1;
                m = i;
            }
            printf("%d ", ans);
            for (int i = 0; i <= m; ++i) {
                if (s1[i] == 0) {
                    if (L == -1) L = i;
                    R = i;
                }
                if (s1[i] == 1 && !vis[lst[r][i]]) {
                    vis[lst[r][i]] = true;
                    Vec.push_back(lst[r][i]);
                }
            }
            if (L == -1) {
                for (int x : Vec) vis[x] = false;
                printf("0\n");
                continue;
            }

            bool flg = false;
            for (int x : Vec) {
                int cur = -1;
                for (int i = 0; i <= m; ++i)
                    if (a[x] & (1 << i)) --s1[i];
                int tot = 0;
                for (int i = 0; i <= m; ++i)
                    tot += (s1[i] > 0);
                for (int i = 0; i <= m; ++i) {
                    if ((a[x] & (1 << i)) == 0) continue;
                    int ct = tot;
                    for (int j = cur + 1; j <= i; ++j) ct += (s1[j] == 0);
                    if (ct == m + 1) flg = true;
                    
                    --s[id(cur + 1, i)];
                    cur = i;
                }
                for (int i = 0; i <= m; ++i)
                    if (a[x] & (1 << i)) ++s1[i];
            }
            for (int i = 0; i <= L; ++i)
                for (int j = R; j <= m; ++j) {
                    if (s[id(i, j)]) {
                        flg = true;
                        break;
                    }
                }
            printf("%d\n", flg ? 1 : 2);
            for (int x : Vec) vis[x] = false;
        }
    }
    return 0;
}