#include <bits/stdc++.h>

using namespace std;

constexpr int L = 30;

vector<int> qslr[L][L];

int main() {
  cin.tie(0)->sync_with_stdio(0);
  for (int tc = (cin >> tc, tc); tc--; ) {
    int n, q; cin >> n >> q;
    vector<int> a(n), tmp(n + 1), ro(q), sing(q), ans(q);
    vector<array<int, 2>> qs(q);
    for (auto& x: a) cin >> x;
    for (auto& [l, r]: qs) cin >> l >> r, --l;
    if (n <= 19) {
      for (auto& [l, r]: qs) {
        int ro{}, rep{};
        for (int i = l; i < r; ++i) {
          rep |= ro & a[i];
          ro |= a[i];
        }
        int ans = ro? (1 << 32 - __builtin_clz(ro)) - 1: 0;
        if (ro == ans) {
          cout << ans << " 0\n";
          continue;
        }
        int sing = ro ^ rep, lost = ~ro & ro + 1, mx = ro;
        for (int i = l; i < r; ++i) if (a[i] >= lost && !(a[i] & a[i] - lost & sing)) mx = max(mx, ro | a[i] - lost);
        cout << ans << ' ' << 2 - (mx == ans) << '\n';
      }
      continue;
    }
    for (int l = 0; l < L; ++l) {
      for (int i = 0; i < n; ++i) tmp[i + 1] = tmp[i] + (a[i] >> l & 1);
      for (int i = 0; i < q; ++i) ro[i] |= (tmp[qs[i][0]] != tmp[qs[i][1]]) << l,
                                sing[i] |= (tmp[qs[i][0]] == tmp[qs[i][1]] - 1) << l;
    }
    for (int i = 0; i < q; ++i) {
      int lb = 0;
      for (int l = 0; l < L; ++l) if (ro[i] >> l & 1) lb = l;
      if (!ro[i] || ro[i] == (2 << lb) - 1) {
        ro[i] = ro[i]? lb + 1 << 2: 0;
        continue;
      }
      int l = L, r = -1;
      for (int j = 0; j < lb; ++j) if (!(ro[i] >> j & 1)) r = j, l = l == L? j: l;
      qslr[l][r].push_back(i);
    }
    for (int l = 0; l < L; ++l)
    for (int r = l; r < L; ++r) {
      for (int i = 0, s = 1 << l, m1 = (1 << r + 1) - s, m2 = m1 + (1u << 31), t = 0; i < n; ++i) tmp[i + 1] = t = (a[i] - s & m2) == m1? i + 1: t;
      for (auto i: qslr[l][r]) {
        bool ok{};
        for (int j = qs[i][1]; !ok && (j = tmp[j] - 1) >= qs[i][0]; ) ok |= !(a[j] & a[j] - (1 << l) & sing[i]);
        int lb = 0;
        for (int l = 0; l < L; ++l) if (ro[i] >> l & 1) lb = l;
        ro[i] = lb + 1 << 2 | 2 - ok;
      }
      qslr[l][r].clear();
    }
    for (int i = 0; i < q; ++i) cout << (1 << ro[i] / 4) - 1 << ' ' << ro[i] % 4 << '\n';
  }
}