#include<bits/stdc++.h>
using namespace std;
#define FOR(i,j,k) for(int i=j;i<=k;++i) 
#define mid (l+r>>1)
const int MAX = 1e5+111;
int a[MAX];
int seg[MAX*4][32];
int que[32];
void build(int l,int r,int x){
	if(l==r){
		FOR(i,0,30) if((1ll<<i)&a[l]) seg[x][i]=1;else seg[x][i]=0;
		return;
	}
	build(l,mid,x<<1),build(mid+1,r,x<<1|1);
	FOR(i,0,30) seg[x][i]=seg[x<<1][i]+seg[x<<1|1][i];
}
void ask(int l,int r,int x,int lft,int rht){
	if(l>rht||r<lft) return;
	if(l>=lft&&r<=rht){
		FOR(i,0,30) que[i] += seg[x][i];
		return;
	}
	ask(l,mid,x<<1,lft,rht),ask(mid+1,r,x<<1|1,lft,rht);
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--){
		int n,q;
		cin>>n>>q;
		FOR(i,1,n) cin>>a[i];
		build(1,n,1);
		FOR(u,1,q){
			int l,r;
			cin>>l>>r;
			FOR(j,0,30) que[j]=0;
			ask(1,n,1,l,r);
			int tmp[30]={},pos[30]={},head = 1,tail = 0;
			int max_or=0,us=0;
			for(int i=30;i>=0;--i){
				if(que[i]){
					if(que[i]>1){
						pos[++tail] = i;
						tmp[  tail] = que[i]-1;
					}
					max_or|=(1ll<<i);
				}
				else{
					if(tail){
						tmp[tail] --;
						us+=pos[tail]-i;
						while(tail>=1&&tmp[tail]==0){
							--tail;
						}
						max_or|=(1ll<<i);
					}
				}
			}
			cout<<max_or<<' '<<us<<endl;
		}
	}
	return 0;
}
/*
2
3 2
10 10 5
1 2
1 3
3 2
10 10 5
1 2
1 3
*/