#include <bits/stdc++.h>
#define rep(i,l,r) for(int i=l; i<=r; i++)
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
using namespace std;
typedef long long ll;
const int V=29,N=1e5+5,M=500;
int a[N],s1[N][V+1],s2[N][M],q1[V+1],q2[M],lb[N][V+1],pre[N][V+1];
int cal[V+1][V+1];
int wk(){
    int l,r;cin>>l>>r; --l;
    int h=-1,mi=100,ma=-1;
    rep(j,0,V){
        q1[j]=s1[r][j]-s1[l][j];
        if(q1[j])h=j;
    }
    rep(j,0,h){
        if(!q1[j])mi=min(mi,j),ma=max(ma,j);
    }
    cout<<(1<<(h+1))-1<<' ';
    if(h==-1)return 0;
    if(*min_element(q1,q1+h)>0)return 0;
    rep(l,0,V){
        rep(r,l,V){
            int t=cal[l][r]; q2[t]=s2[r][t]-s2[l][t];
        }
    }
    vector<int>vec;
    rep(j,0,h){
        if(q1[j]==1)vec.push_back(pre[r][j]);
    }
    sort(vec.begin(),vec.end());
    // vec.resize(unique(vec.begin(),vec.end())-vec.begin());
    int sz=vec.size();
    int L=0;
    while(L<sz){
        int R=L;
        while(R+1<sz && vec[R+1]==vec[L])++R;
        int i=vec[L];
        if(R-L+1>=2){
            rep(j,0,V){
                if(lb[i][j]!=-1)--q2[cal[lb[i][j]][j]];
            }
        }
        else{
            rep(j,0,V){
                int x=lb[i][j];
                if(x!=-1 && q1[j]!=1)--q2[cal[x][j]];
            }
        }
        L=R+1;
    }
    // cout<<mi<<' '<<ma<<endl;
    rep(l,0,mi){
        rep(r,max(l,ma),V)if(q2[cal[l][r]]>0)return 1;
    }
    return 2;
}
void slv(){
    int n,Q;cin>>n>>Q;
    rep(i,1,n){
        cin>>a[i];
        int h=0;
        rep(j,0,V){
            int v=(a[i]&(1<<j))>0;
            s1[i][j]=s1[i-1][j]+v;
            if(v)pre[i][j]=i,lb[i][j]=h,h=j+1;
            else pre[i][j]=pre[i-1][j],lb[i][j]=-1;
        }
        rep(l,0,V){
            rep(r,l,V)s2[i][cal[l][r]]=s2[i-1][cal[l][r]]+(lb[i][r]==l);
        }
    }
    while(Q--){
        cout<<wk()<<'\n';
    }
}
int main() {
    IOS
    int cnt=0;
    rep(l,0,V){
        rep(r,l,V)cal[l][r]=++cnt;
    }
    int T;cin>>T;
    while(T--)slv();
    return 0;
}
/*
1 
3 1
6 4 2
1 2
*/