#include <bits/stdc++.h>

using namespace std;

constexpr int L = 30;

vector<int> cntz[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) cntz[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) {
      cntz[l][r][i + 1] = cntz[l][r][i] + ((a[i] & (1 << r + 1) - (1 << l)) == 0 && a[i] >= (1 << l));
    }
    while (q--) {
      int l, r; cin >> l >> r; --l;
      int ro = 0;
      for (int i = 0; i < L; ++i) ro |= (cnto[i][r] != cnto[i][l]) << 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;}
      vector<int> banned;
      for (int i = 0; i < L; ++i) if ((i < lz || i > rz) && cnto[i][r] == cnto[i][l] + 1) if (auto t = lsto[i][r] - 1;
          (a[t] & (1 << rz + 1) - (1 << l)) == 0 && a[t] >= (1 << l) && (a[t] - (1 << l) >> i & 1)) banned.push_back(t);
      sort(banned.begin(), banned.end());
      if (cntz[lz][rz][r] - cntz[lz][rz][l] != unique(banned.begin(), banned.end()) - banned.begin()) {
        cout << (2 << lb) - 1 << " 1\n";
      } else {
        cout << (2 << lb) - 1 << " 2\n";
      }
    }
  }
}