#include <bits/stdc++.h>
using namespace std ;

#define ff    first
#define ss    second
#define pb    push_back

typedef long long    ll;
typedef pair<ll,ll>    ii;
typedef long double    lf;


mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll SQ = 800;
const ll N = 1e5+5;
const ll mod = 998244353;
const ll oo = 1e18;


vector <int> hv[30][30];
int psum[30][N];

int main(){
  #ifdef LOCAL
  freopen("input.txt","r",stdin);
  #endif // LOCAL
  ios_base::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);

  int t; cin >> t;
  while (t--) {
     int n, q; cin >> n >> q;
     vector <int> a(n);
     for (auto &e : a) cin >> e;
     for(int j =0;j<30;++j){
        for(int k=0;k<30;++k) hv[j][k].clear();
     }
     for (int i = 0; i < n; ++i) {
        for (int j = 29; j >= 0; --j) {
           if (i) psum[j][i] = psum[j][i-1];
           else psum[j][i]=0;
        }
        for (int j = 29; j >= 0; --j) {
            if (a[i] & (1<<j)) {
               psum[j][i]++;
               int sj = j;
               while (j > 0 && (a[i] & (1<<(j-1))) == 0) j--;
               for (int k = sj; k >= j; --k) {
                  for(int h = k; h >= j; --h) hv[k][h].pb(i);
               }
            }
        }
     }
     for (int i = 0; i < q; i++) {
        int l,r; cin >> l >> r;
        r--;l--;
        int yet = 0;
        int mx = -1, mn;
        int unq = (1<<30)-1;
        int pp = -1;
        for (int j = 29; j >= 0; --j) {
           int v = psum[j][r] - (l ? psum[j][l-1] : 0);
           if (v >= 1) {
              if (v == 1) unq ^= (1<<j);
              yet=1;
              pp = max(pp, j);
           }
           else {
              if (yet) {
                 if (mx == -1) mx = j;
                 mn = j;
              }
           }
        }
        int desired = (1 << (pp+1))-1;
        if (mx == -1) cout << desired << " " << 0 << '\n';
        else {
          int fs = lower_bound(hv[mx][mn].begin(), hv[mx][mn].end(), l) - hv[mx][mn].begin();
          int can = 2;
          while (fs < hv[mx][mn].size() && hv[mx][mn][fs] <= r) {
            int idx = hv[mx][mn][fs];
            if ((unq & a[idx]) == a[idx]) {
              can = 1;
              break;
            }
            fs++;
          }
          cout << desired << ' ' << can << '\n';
        }
     }
  }
  return 0;
}