#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define maxn 200005
#define put() putchar('\n')
#define Tp template<typename Ty>
#define Ts template<typename Ty,typename... Ar>
using namespace std;
void read(int &x){
    int f=1;x=0;char c=getchar();
    while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
    while (c>='0'&&c<='9') {x=x*10+c-'0';c=getchar();}
    x*=f;
}
namespace Debug{
	Tp void _debug(char* f,Ty t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,Ty x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	Tp ostream& operator<<(ostream& os,vector<Ty>& V){os<<"[";for(auto& vv:V) os<<vv<<",";os<<"]";return os;}
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
#define fi first
#define se second
#define mk make_pair
const int mod=1e9+7;
int power(int x,int y=mod-2) {
	int sum=1;
	while (y) {
		if (y&1) sum=sum*x%mod;
		x=x*x%mod;y>>=1;
	}
	return sum;
}
set<int>t[32][32];
int suf[32][maxn],pre[32][maxn],a[maxn],n,m,fl[32],vis[32];
int tr[maxn],id[maxn];
void solve(void) {
	int i,j,l,r;
	read(n);read(m);
	for (i=1;i<=n;i++) {
		read(a[i]);
		for (j=0;j<=30;j++) suf[j][i]=suf[j][i-1],pre[j][i]=pre[j][i-1];
		int las=-1;
		for (j=0;j<=30;j++) if ((a[i]>>j)&1) {
			suf[j][i]++;
			pre[j][i]=i;
			t[las+1][j].insert(i);
			las=j;
		}
	}
	while (m--) {
		read(l);read(r);
		int Max=0;
		for (i=0;i<=30;i++) vis[i]=fl[i]=0;
		for (i=0;i<=30;i++) 
			if (pre[i][r]<l) fl[i]=0;
			else {
				fl[i]=1;
				if (suf[i][r]-suf[i][l-1]==1) vis[i]=pre[i][r];
				Max=i;
			}
		int tmp1=0,tmp2=0,tmp3=0,ql=0,qr=-1,flag=0;
		for (i=0;i<=Max;i++) 
			if (fl[i]==0&&(i==0||fl[i-1]==1)) {
				if (qr!=-1) {flag=1;break;} 
				ql=i;
			}
			else if (fl[i]==1&&fl[i-1]==0) qr=i-1;
//		gdb(l,r);
		if (flag) {printf("%d 2\n",(1<<Max+1)-1);continue;}
		if (qr==-1) {printf("%d 0\n",(1<<Max+1)-1);continue;}
		for (i=0;i<=Max;i++) if (vis[i]) tr[vis[i]]++,id[vis[i]]=i; 
		for (i=0;i<=ql&&!flag;i++) {
			for (j=qr;j<=Max&&!flag;j++) {
				for (auto it=t[i][j].lower_bound(l);(*it)<=r&&it!=t[i][j].end();it++) {
					int tmp=*it;
//					gdb(i,j,tmp);
					if (tr[tmp]==0||(tr[tmp]==1&&id[tmp]==j)) {flag=1;tmp1=tmp,tmp2=i;tmp3=j;break;}  
				}
			}
		}
		for (i=0;i<=Max;i++) if (vis[i]) tr[vis[i]]=0,id[vis[i]]=0; 
		if (flag) {
			int sum=0;
			for (i=l;i<=r;i++) if (i^tmp1) sum|=a[i];
			sum|=((1<<tmp3+1)-(1<<tmp2));
//			gdb(tmp1,tmp2,tmp3,sum);
			assert(sum==(1<<Max+1)-1);
		}
		printf("%d %d\n",(1<<Max+1)-1,(flag==0)+1);
	}
}
signed main(void){
	int T;
	read(T);
	while (T--) solve();
	return 0;
}