#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

template <typename T>
struct segment_tree {
    static const int N = 1e5 + 10;
    const T inf = numeric_limits<T>::max() / 2;
    T t[2 * N + 10];
    void build() {
        for (int i = N - 1; i > 0; i--) {
            t[i] = t[i << 1] | t[i << 1 | 1];
        }
    }
    void update(int pos, T val) {
        for (t[pos += N] = val; pos > 1; pos >>= 1) {
            t[pos >> 1] = t[pos] | t[pos ^ 1];
        }
    }
    T get(int l, int r) {
        T res = 0;
        for (l += N, r += N; l <= r; l >>= 1, r >>= 1) {
            if (l & 1) res |= t[l++];
            if (!(r & 1)) res |= t[r--];
        }
        return res;
    }
};

template <typename T>
struct segment_tree_max {
    static const int N = 1e5 + 10;
    const T inf = numeric_limits<T>::max() / 2;
    T t[2 * N + 10];
    void build() {
        for (int i = N - 1; i > 0; i--) {
            t[i] = max(t[i << 1], t[i << 1 | 1]);
        }
    }
    void update(int pos, T val) {
        for (t[pos += N] = val; pos > 1; pos >>= 1) {
            t[pos >> 1] = max(t[pos], t[pos ^ 1]);
        }
    }
    T get(int l, int r) {
        T res = -inf;
        for (l += N, r += N; l <= r; l >>= 1, r >>= 1) {
            if (l & 1) res = max(res, t[l++]);
            if (!(r & 1)) res = max(res, t[r--]);
        }
        return res;
    }
};

segment_tree<int> tree;
segment_tree_max<int> tree_max;

const int B = 30;
const int N = 1e5 + 10;
int a[N];
vector<int> pos[B][B];

bool getbit(int mask, int bit) {
    return mask & (1 << bit);
}

pair<int, int> get(int mask) {
    int l = -1, r = -1;
    for (int i = 0; i < B; i++) {
        if (getbit(mask, i)) {
            if (l == -1) {
                l = i;
            }
            r = i;
        }
    }
    return {l, r};
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
#endif

    int t;
    cin >> t;
    while (t--) {
        int n, q;
        cin >> n >> q;
        for (int i = 1; i <= n; i++) {
            cin >> a[i];
        }
        for (int i = 0; i < B; i++) {
            for (int j = 0; j < B; j++) {
                pos[i][j].clear();
            }
        }
        for (int i = 1; i <= n; i++) {
            for (int b = 0; b < B && (1 << b) <= a[i]; b++) {
                int x = a[i] ^ (a[i] - (1 << b));
                auto [l, r] = get(x);
                pos[l][r].push_back(i);
            }
        }
        for (int i = 1; i <= n; i++) {
            tree.update(i, a[i]);
            tree_max.update(i, a[i]);
        }
        while (q--) {
            int l, r;
            cin >> l >> r;
            int zero_or = tree.get(l, r);
            int max_val = tree_max.get(l, r);
            auto [_, max_bit] = get(max_val);
            int ans = (1 << (max_bit + 1)) - 1;
            if (zero_or == ans) {
                cout << ans << " 0\n";
            } else {
                int trg = ans ^ zero_or;
                auto [lef, rig] = get(trg);
                bool ok = false;
                for (int L = 0; L <= lef; L++) {
                    for (int R = rig; R <= B - 1; R++) {
                        auto it = lower_bound(pos[L][R].begin(), pos[L][R].end(), l);
                        if (it != pos[L][R].end() && *it <= r) {
                            ok = true;
                        }
                    }
                }
                if (ok) {
                    cout << ans << " 1\n";
                } else {
                    cout << ans << " 2\n";
                }
            }
        }
    }

#ifdef LOCAL
    cout << "\nTime elapsed: " << double(clock()) / CLOCKS_PER_SEC << " s.\n";
#endif
}