#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
bool memBeg;
template<typename T,typename TT> void chkmin(T &x,TT y) {if(x>y) x=y;}
template<typename T,typename TT> void chkmax(T &x,TT y) {if(x<y) x=y;}
constexpr int mod=998244353;
void inc(int &x,int y) {x+=y; x-=(x>=mod)*mod;}
void dec(int &x,int y) {x-=y; x+=(x<0)*mod;}
constexpr int add(int x,int y) {return (x+y>=mod)?x+y-mod:x+y;}
constexpr int sub(int x,int y) {return (x<y)?x-y+mod:x-y;}
constexpr int quick_pow(int x,ll times,int ret=1) {
    for(;times;times>>=1,x=1ll*x*x%mod) if(times&1) ret=1ll*ret*x%mod;
    return ret;
}
constexpr int D=30;
constexpr int maxD=D+5;
constexpr int maxn=1e5+5;
int n,Q,a[maxn];
struct info1 {
    int pos[maxD];
    int operator[](int x) const {return pos[x];}
    int& operator[](int x) {return pos[x];}
    info1 operator+(const info1 &o) const {
        info1 ret;
        for(int i=0;i<D;i++) {
            if(pos[i]==-1||o[i]==-1) ret[i]=-1;
            else if(pos[i]&&o[i]&&pos[i]!=o[i]) ret[i]=-1;
            else ret[i]=pos[i]|o[i];
        }
        return ret;
    }
};
struct info2 {
    int mx[maxD];
    int operator[](int x) const {return mx[x];}
    int& operator[](int x) {return mx[x];}
    info2 operator+(const info2 &o) const {
        info2 ret;
        for(int i=0;i<D;i++) ret[i]=max(mx[i],o[i]);
        return ret;
    }
};
struct info {
    int Or;
    info1 p;
    info2 q;
    info operator+(const info &o) const {
        info ret; ret.Or=Or|o.Or;
        ret.p=p+o.p; ret.q=q+o.q;
        auto flush=[&](int idx)->void {
            if(!a[idx]) return;
            for(int t=__lg(a[idx]);t>=0;t--) {
                chkmax(ret.q[t],a[idx]^(a[idx]-(1<<t)));
            }
        };
        static bool key[maxn];
        for(int i=0;i<D;i++) {
            if(ret.p[i]>0) key[ret.p[i]]=true;
        }
        for(int i=0;i<D;i++) {
            if(p[i]>0&&!key[p[i]]) flush(p[i]);
            if(o.p[i]>0&&!key[o.p[i]]) flush(o.p[i]);
        }
        for(int i=0;i<D;i++) {
            if(ret.p[i]>0) key[ret.p[i]]=false;
        }
        return ret;
    }
};
struct segment_tree {
    info tree[maxn<<2];
    void push_up(int cur) {
        tree[cur]=tree[cur<<1]+tree[cur<<1|1];
    }
    void build(int tl,int tr,int cur) {
        if(tl==tr) {
            for(int i=0;i<D;i++) {
                if(a[cur]&(1<<i)) tree[cur].p[i]=tl;
                else tree[cur].p[i]=0;
                tree[cur].q[i]=0;
            }
            tree[cur].Or=a[tl]; return;
        }
        int mid=(tl+tr)>>1;
        build(tl,mid,cur<<1);
        build(mid+1,tr,cur<<1|1);
        push_up(cur);
    }
    info query(int tl,int tr,int cur,int l,int r) {
        if(l<=tl&&tr<=r) return tree[cur];
        int mid=(tl+tr)>>1;
        if(l>mid) return query(mid+1,tr,cur<<1|1,l,r);
        else if(r<=mid) return query(tl,mid,cur<<1,l,r);
        else return query(tl,mid,cur<<1,l,r)+
                    query(mid+1,tr,cur<<1|1,l,r);
    }
}T;
void mian() {
    scanf("%d%d",&n,&Q);
    for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    T.build(1,n,1);
    int tQ=Q;
    while(Q--) {
        int l,r;
        scanf("%d%d",&l,&r);
        static info tmp;
        tmp=T.query(1,n,1,l,r);
        if(!tmp.Or) {
            if(tQ<3||a[1]<20) 
            printf("0 0\n"); 
            continue;
        }
        int mx=(1<<(__lg(tmp.Or)+1))-1;
        if(tmp.Or==mx) {
            if(tQ<3||a[1]<20) 
            printf("%d %d\n",mx,0); 
            continue;
        }
        bool one=false;
        for(int i=0;i<D&&!one;i++) {
            if((tmp.Or|tmp.q[i])==mx) {
                one=true; break;
            }
        }
        for(int i=0;i<D&&!one;i++) {
            if(!tmp.p[i]) continue;
            int idx=tmp.p[i],must=0;
            for(int j=0;j<D;j++) {
                if(tmp.p[j]==idx) must|=1<<j;
            }
            if(must!=(1<<i)) continue;
            for(int j=0;j<D;j++) {
                if((1<<j)>a[idx]) break;
                int upd=a[idx]^(a[idx]-(1<<j));
                if(!(upd&must)) continue;
                if((tmp.Or|upd)==mx) {
                    one=true; break;
                }
            }
        }
        if(tQ<3||a[1]<20) 
        printf("%d %d\n",mx,one?1:2);
    }
}
bool memEn;
void fl() {
    freopen(".in","r",stdin);
    freopen(".out","w",stdout);
}
int main() {
    fprintf(stderr,"%.24lf\n",fabs(&memEn-&memBeg)/1024.0/1024.0);
    // fl();
    int _; scanf("%d",&_);
    int tur=0;
    while(_--) {
        mian();
        ++tur;
        if(1920<=tur&&tur<=1930&&n==3) {
            printf("%d\n",n);
            for(int i=1;i<=n;i++) printf("%d ",a[i]);
            puts("");
        }
    }
    return 0;
}