#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int T,n,q;
int a[100005],pval[100005][35];

pii res[100005];
vector <pii> Qry[100005];
struct info{
	int pos,val;
};
vector <info> P[100005];

int ans[100005];
void upd(int x,int y){
	while(x && ans[x] < y){
		ans[x] = y;
		x--;
	}
}

inline int lowbit(int x) {return x & (-x);}

void recalc(int l,int r){//重新结算 [l,r] 的 ext 值
	int sum = 0,tmp,pos;
	per(i,r,l){
		pos = i;
		per(k,SZ(P[i - 1]) - 1,0){
			tmp = P[i - 1][k].val | sum;
			tmp |= pval[i][ctz(tmp + 1)];
			upd(pos,ctz(tmp + 1));
			pos = P[i - 1][k].pos - 1;
		}
		sum |= a[i];
	}
}

void solve(){
	scanf("%d%d",&n,&q);
	rep(i,1,n){
		scanf("%d",&a[i]);
		Qry[i].clear();
		ans[i] = -1;
		per(k,30,0){
			if(a[i] & (1 << k)) pval[i][k] = 1 << k;
			else pval[i][k] = pval[i][k + 1] | (1 << k);
		}
	}
	rep(i,1,q){
		int l,r;
		scanf("%d%d",&l,&r);
		Qry[r].eb(mkp(l,i));
	}
	rep(r,1,n){
		P[r].clear();
		int pst = -1,pos = r;
		for(info I:P[r - 1]){
			if((I.val | a[r]) != I.val) chkmin(pos,I.pos);
			if((I.val | a[r]) == pst) continue;
			P[r].push_back({I.pos,I.val | a[r]});
			pst = I.val | a[r];
		}
		if(pst != a[r]) P[r].push_back({r,a[r]});
		recalc(max(1,pos - 1),r);
		for(pii I:Qry[r]){
			int tmp = 0;
			for(info II:P[r]) if(II.pos <= I.first) chkmax(tmp,II.val);
//			printf("%d->%d\n",I.second,tmp);

			if(lowbit(tmp + 1) == tmp + 1){
				res[I.second] = mkp(tmp,0);
			}else if(ans[I.first] == __lg(tmp) + 1){
				res[I.second] = mkp((1 << (__lg(tmp) + 1)) - 1,1);
			}else{
				res[I.second] = mkp((1 << (__lg(tmp) + 1)) - 1,2);
			}
		}
	}
	rep(i,1,q) printf("%d %d\n",res[i].first,res[i].second);
}

int main(){
//	freopen("test.in","r",stdin);
	scanf("%d",&T);
	while(T--) solve();
	return 0;
}