#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];

typedef array<int, L> T;
T mi[400005];

T operator+(const T &a, const T &b) {
    T res;
    for (int i = 0; i < L; ++i)
        res[i] = min(a[i], b[i]);
    return res;
}

void build(int l, int r, int rt) {
    if (l == r) {
        for (int i = 0; i < L; ++i)
            if (arr[l] >= (1 << i))
                mi[rt][i] = arr[l] & ((1 << (i + 1)) - 1);
            else
                mi[rt][i] = 1 << L;
        return;
    }
    int mid = (l + r) >> 1;
    build(l, mid, rt << 1), build(mid + 1, r, rt << 1 | 1);
    mi[rt] = mi[rt << 1] + mi[rt << 1 | 1];
}

T query(int L, int R, int l, int r, int rt) {
    if (L <= l && R >= r) return mi[rt];
    int mid = (l + r) >> 1;
    if (R <= mid) return query(L, R, l, mid, rt << 1);
    if (L > mid) return query(L, R, mid + 1, r, rt << 1 | 1);
    return query(L, R, l, mid, rt << 1) + query(L, R, mid + 1, r, rt << 1 | 1);
}

void solve() {
    int n, q;
    cin >> n >> q;
    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];
        }
    }
    build(1, n, 1);
    while (q--) {
        int l, r;
        cin >> l >> r;
        int fin = 0, ans = 0, start = -1;
        for (int i = L - 1; i >= 0; --i)
            if (cnt[r][i] - cnt[l - 1][i] > 0) {
                fin |= 1 << i;
                if (cnt[r][i] - cnt[l - 1][i] > 1) {
                    start = i - 1;
                    fin |= (1 << i) - 1;
                    break;
                }
            }
        T res = query(l, r, 1, n, 1);
        while (start >= 0) {
            if (cnt[r][start] - cnt[l - 1][start] > 0) --start;
            else {
                int lg;
                if (res[start] == 0) lg = -1;
                else lg = __lg(res[start]);
                assert(lg < start);
                start = lg - 1;
                ++ans;
            }
        }
        cout << fin << " " << ans << "\n";
    }
}

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