#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define pb push_back
#define eb emplace_back
#define MP make_pair
#define MT make_tuple
#define IT iterator
#define fi first
#define se second
#define For(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define Rep(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define CLR(a, v) memset(a, v, sizeof(a))
#define CPY(a, b) memcpy(a, b, sizeof(a))
#define debug cerr << "ztxakking\n"
#define y0 ztxaknoi
#define y1 ztxakioi
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using vi = vector<int>;
template<typename T>
using V = vector<T>;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
bool mem1;
const int N = 1e5 + 7;
int n, q, a[N];
struct info {
  int w[30], OR;
  V<pii> ban;
};
info mrg(info a, info b) {
  info c;
  c.OR = a.OR | b.OR;
  For(i, 0, 29) c.w[i] = max(a.w[i], b.w[i]);
  for (auto [x, y] : a.ban) {
    if ((y | b.OR) != c.OR) c.ban.eb(x, y | b.OR);
    else {
      For(i, 0, __lg(x)) c.w[i] = max(c.w[i], x ^ (x - (1 << i)));
    }
  }
  for (auto [x, y] : b.ban) {
    if ((y | a.OR) != c.OR) c.ban.eb(x, y | a.OR);
    else {
      For(i, 0, __lg(x)) c.w[i] = max(c.w[i], x ^ (x - (1 << i)));
    }
  }
  assert(c.ban.size() <= 30);
  return c;
}
struct node {
  int l, r, mx;
  info f;
} tr[N * 4];
#define ls (p * 2)
#define rs (p * 2 + 1)
void pushup(int p) {
  tr[p].mx = max(tr[ls].mx, tr[rs].mx);
  tr[p].f = mrg(tr[ls].f, tr[rs].f);
}
void build(int p, int l, int r) {
  tr[p].l = l, tr[p].r = r;
  if (l == r) {
    tr[p].mx = a[l];
    tr[p].f.OR = a[l];
    tr[p].f.ban.clear();
    if (a[l]) {
      tr[p].f.ban.eb(a[l], 0);
    }
    return ;
  }
  int mid = (l + r) / 2;
  build(ls, l, mid), build(rs, mid + 1, r);
  pushup(p);
}
int qrymx(int p, int x, int y) {
  if (tr[p].l >= x && tr[p].r <= y) return tr[p].mx;
  int mid = (tr[p].l + tr[p].r) / 2, ans = 0;
  if (x <= mid) ans = max(ans, qrymx(ls, x, y));
  if (mid < y) ans = max(ans, qrymx(rs, x, y));
  return ans;
}
info qry(int p, int x, int y) {
  if (tr[p].l >= x && tr[p].r <= y) return tr[p].f;
  int mid = (tr[p].l + tr[p].r) / 2;
  if (y <= mid) return qry(ls, x, y);
  if (mid < x) return qry(rs, x, y);
  return mrg(qry(ls, x, y), qry(rs, x, y));
}
void sol() {
  cin >> n >> q;
  For(i, 1, n) cin >> a[i];
  build(1, 1, n);
  while (q--) {
    int l, r; cin >> l >> r;
    int ans = (1 << __lg(qrymx(1, l, r)) + 1) - 1;
    cout << ans << ' ';
    info t = qry(1, l, r);
    if (t.OR == ans) cout << "0\n";
    else {
      bool ok = 0;
      For(i, 0, 29) if ((t.w[i] | t.OR) == ans) { ok = 1; break; }
      cout << (ok? 1 : 2) << '\n';
    }
  }
}
bool mem2;
int main() {
  cerr << abs(&mem1 - &mem2) / 1048576. << '\n';
  ios::sync_with_stdio(0), cin.tie(0);
  int t; cin >> t;
  while (t--) sol();
  return 0;
}