#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#define maxn 100005
#define maxm 35
using namespace std;
int T,n,q,in[maxn],l,r; bool uni[maxn]; int calc(int val,int bit){return val^(val-(1<<bit));}
struct node{
	int spe[maxm],mmax[maxm],l,r; node(){memset(spe,0,sizeof(spe)); memset(mmax,0,sizeof(mmax));}
	node operator += (const node &x){
		for(int i=1;i<=n;i++) mmax[i]=max(mmax[i],x.mmax[i]);
		vector<int> del; for(int i=0;i<maxm;i++) if(!spe[i]||!x.spe[i])
			{if(spe[i]>0) uni[spe[i]]=1,del.push_back(spe[i]); if(x.spe[i]>0) uni[x.spe[i]]=1,del.push_back(x.spe[i]);}
		for(int i=0;i<maxm;i++) if(spe[i]&&x.spe[i]){
			if(spe[i]>0&&!uni[spe[i]]) for(int j=0;j<maxm&&(1<<j)<=in[spe[i]];j++) mmax[i]=max(mmax[i],calc(in[spe[i]],j));
			if(x.spe[i]>0&&!uni[x.spe[i]])
				{for(int j=0;j<maxm&&(1<<j)<=in[x.spe[i]];j++) mmax[i]=max(mmax[i],calc(in[x.spe[i]],j));} spe[i]=-1;
		}else spe[i]|=x.spe[i]; for(auto i:del) uni[i]=0; return *this;
	}
	node operator + (const node &a)const{
		return node(*this)+=a;
	}
}a[maxn*4];
void pushup(int p){a[p]=a[p<<1]+a[p<<1|1];}
void build(int p,int l,int r){
	for(int i=0;i<maxm;i++) a[p].spe[i]=a[p].mmax[i]=0; a[p].l=l; a[p].r=r; if(l==r)
		{for(int i=0;i<maxm;i++) a[p].spe[i]=(in[l]&(1<<i))?l:0; return;}
	build(p<<1,l,(l+r)>>1); build(p<<1|1,((l+r)>>1)+1,r); pushup(p); a[p].l=l; a[p].r=r;
}
node query(int p,int l,int r){
	if(l<=a[p].l&&r>=a[p].r) return a[p]; node res;
	if(r<=a[p<<1].r) return query(p<<1,l,r); if(l>=a[p<<1|1].l) return query(p<<1|1,l,r);
	return query(p<<1,l,r)+query(p<<1|1,l,r);
}
int main(){
	scanf("%d",&T); while(T--){
		scanf("%d%d",&n,&q); for(int i=1;i<=n;i++) scanf("%d",&in[i]),uni[i]=0;
		build(1,1,n); while(q--){
			scanf("%d%d",&l,&r); node x=query(1,l,r); int now=0;
			for(int i=0;i<maxm;i++) now|=(x.spe[i]!=0)*(1<<i); int ans=1;
			for(;ans<=now;ans*=2); ans--; printf("%d ",ans); if(now==ans){printf("0\n"); continue;}
			bool flag=0; for(int i=0;i<maxm;i++) if((now|x.mmax[i])==ans){printf("1\n"); flag=1; break;}
			for(int i=0;i<maxm&&!flag;i++) if(x.spe[i]>0){
				int res=now^(1<<x.spe[i]); for(int j=0;j<maxm&&(1<<j)<=in[x.spe[i]];j++)
					if(res|calc(in[x.spe[i]],j)==ans){printf("1\n"); flag=1; break;}
			} if(!flag) printf("2\n");
		}
	} return 0;
}