//Δ_A 
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double DB;
const int N = 111111;
int n,q,a[N],f[N][22];
vector<pair<int,int> > v;
int main(){
	int T,i,j,x,y,s,o;
	scanf("%d",&T);
	while(T--){
		scanf("%d%d",&n,&q);
		for(i=1;i<=n;i++)
			scanf("%d",a+i);
		v.clear();
		for(i=1;i<=n;i++)
			for(x=1;x<=a[i];x<<=1)
				v.push_back(make_pair(a[i]-x,i));
		sort(v.begin(),v.end());
		for(i=1;i<=n;i++)
			f[i][0]=a[i];
		for(j=1;j<=20;j++)
			for(i=1;i<=n;i++)
				if(i+(1<<(j-1))<=n)
					f[i][j]=f[i][j-1]|f[i+(1<<(j-1))][j-1];
		while(q--){
			scanf("%d%d",&x,&y);
			s=0;
			for(j=20,i=x;i<=y;j--)
				if(i+(1<<j)<=y+1)
					s|=f[i][j],i+=1<<j;
			if(s==0)
				printf("0 0\n");
			else{
				o=(1<<(32-__builtin_clz(s)))-1;
				printf("%d ",o);
				s^=o;
				if(!s)
					o=0;
				else{
					i=lower_bound(v.begin(),v.end(),make_pair(s,x))-v.begin();
					if(i<v.size()&&v[i].first==s&&v[i].second<=y)
						o=1;
					else
						o=2;
				}
				printf("%d\n",o);
			}
		}
	}
	return 0;
}