#include <bits/stdc++.h>

using namespace std;

constexpr int L = 30;

vector<int> lstz[L][L], cnto[L], lsto[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);
    for (int i = 0; i < n; ++i) cin >> a[i];
    for (int i = 0; i < L; ++i)
    for (int j = 0; j <= i; ++j) lstz[j][i].resize(n + 1);
    for (int i = 0; i < L; ++i) cnto[i].resize(n + 1), lsto[i].resize(n + 1);
    for (int i = 0; i < n; ++i)
    for (int b = 0; b < L; ++b) cnto[b][i + 1] = cnto[b][i] + (a[i] >> b & 1), lsto[b][i + 1] = a[i] >> b & 1? i + 1: lsto[b][i];
    for (int i = 0; i < n; ++i)
    for (int l = 0; l < L; ++l)
    for (int r = l; r < L; ++r) {
      lstz[l][r][i + 1] = (a[i] & (1 << r + 1) - (1 << l)) == 0 && a[i] >= (1 << l)? i + 1: lstz[l][r][i];
    }
    while (q--) {
      int l, r; cin >> l >> r; --l;
      int ro = 0, sing = 0;
      for (int i = 0; i < L; ++i) ro |= (cnto[i][r] != cnto[i][l]) << i, sing |= (cnto[i][r] == cnto[i][l] + 1) << i;
      if (!ro) {
        cout << "0 0\n";
        continue;
      }
      int lb = 0;
      for (int i = 0; i < L; ++i) if (ro >> i & 1) lb = i;
      if (ro == (2 << lb) - 1) {
        cout << ro << " 0\n";
        continue;
      }
      int lz = L, rz = -1;
      for (int i = 0; i < lb; ++i) if (!(ro >> i & 1)) rz = i;
      for (int i = 0; i < lb; ++i) if (!(ro >> i & 1)) {lz = i;break;}
      bool ok = 0;
      for (int i = r; !ok && (i = lstz[lz][rz][i] - 1) >= l; ) ok |= !(a[i] - (1 << lz) & sing);
      if (ok) {
        cout << (2 << lb) - 1 << " 1\n";
      } else {
        cout << (2 << lb) - 1 << " 2\n";
      }
    }
  }
}