#include <bits/stdc++.h>
 
using namespace std;

const int MAX_N = 100000 + 5;
const int MAX_M = 32;

int N, M, Q, a[MAX_N], sor[1 << 18];
struct SegmentNode{
    int cnt, minv, idx;
    
    SegmentNode (int a = 0, int b = 0, int c = 0) : cnt(a), minv(b), idx(c) {}
    
    void init(int x, int k, int l) {
        cnt = x >> k & 1;
        if (x < (1 << k)) minv = 32;
        else {
            if (k) {
                int tmp = x & (1 << k) - 1;
                if (!tmp) minv = 0;
                else minv = 32 - __builtin_clz(tmp);
            }else {
                minv = 0;
            }
        }
        idx = cnt ? l : 0;
    }
    
    inline SegmentNode operator + (const SegmentNode &x) const {
        return (SegmentNode){cnt + x.cnt, min(minv, x.minv), idx ^ x.idx};
    }
}node[MAX_M][1 << 18], b[32];

void segment_build1(int i, int l, int r) {
    if (l == r) {
        sor[i] = a[l];
        return ;
    }
    int mid = l + r >> 1;
    segment_build1(i << 1, l, mid);
    segment_build1(i << 1 | 1, mid + 1, r);
    sor[i] = sor[i << 1] | sor[i << 1 | 1];
}

int segment_query1(int i, int l, int r, int ql, int qr) {
    if (l < ql || r > qr) {
        int res = 0, mid = l + r >> 1;
        if (ql <= mid) res = segment_query1(i << 1, l, mid, ql, qr);
        if (mid < qr) res |= segment_query1(i << 1 | 1, mid + 1, r, ql, qr);
        return res;
    }else {
        return sor[i];
    }
}

void segment_build2(int k, int i, int l, int r) {
    if (l == r) {
        node[k][i].init(a[l], k, l);
        return ;
    }
    int mid = l + r >> 1;
    segment_build2(k, i << 1, l, mid);
    segment_build2(k, i << 1 | 1, mid + 1, r);
    node[k][i] = node[k][i << 1] + node[k][i << 1 | 1];
}

void segment_modify2(int k, int i, int l, int r, int x, int v) {
    if (l == r) {
        node[k][i].init(v, k, l);
        return ;
    }
    int mid = l + r >> 1;
    mid < x ? segment_modify2(k, i << 1 | 1, mid + 1, r, x, v) : segment_modify2(k, i << 1, l, mid, x, v);
    node[k][i] = node[k][i << 1] + node[k][i << 1 | 1];
}

SegmentNode segment_query2(int k, int i, int l, int r, int ql, int qr) {
    if (l < ql || r > qr) {
        int mid = l + r >> 1;
        SegmentNode res(0, 32, 0);
        if (ql <= mid) res = segment_query2(k, i << 1, l, mid, ql, qr);
        if (mid < qr) res = res + segment_query2(k, i << 1 | 1, mid + 1, r, ql, qr);
        return res;
    }else {
        return node[k][i];
    }
}

int main() {
    int T;
    scanf("%d", &T);
    while (T --) {
        scanf("%d%d", &N, &Q);
        M = 0;
        for (int i = 1; i <= N; i ++) {
            scanf("%d", a + i);
            if (a[i]) M = max(M, 31 - __builtin_clz(a[i]));
        }
        segment_build1(1, 1, N);
        for (int i = 0; i <= M; i ++) {
            segment_build2(i, 1, 1, N);
        }
        while (Q --) {
            int l, r;
            scanf("%d%d", &l, &r);
            int res = segment_query1(1, 1, N, l, r);
            if (!res) {
                printf("0 0\n");
                continue;
            }
            int t = 31 - __builtin_clz(res);
            if (res == (1 << t + 1) - 1) {
                printf("%d 0\n", res);
                continue;
            }
            for (int i = 0; i <= t; i ++) {
                b[i] = segment_query2(i, 1, 1, N, l, r);
            }
            int x, y;
            for (x = t; res >> x & 1; x --);
            for (y = 0; res >> y & 1; y ++);
            for (int i = 0; i < t; i ++) {
                if (b[i].cnt == 1 && a[b[i].idx] >= (1 << i + 1)) segment_modify2(x, 1, 1, N, b[i].idx, 0);
            }
            int cur = segment_query2(x, 1, 1, N, l, r).minv;
            if (cur <= y) printf("%d 1\n", (1 << t + 1) - 1);
            else printf("%d 2\n", (1 << t + 1) - 1);
            for (int i = 0; i < t; i ++)
                if (b[i].cnt == 1 && a[b[i].idx] >= (1 << i + 1)) segment_modify2(x, 1, 1, N, b[i].idx, a[b[i].idx]);
        }
    }
    return 0;
}