#pragma GCC optimize(3,"Ofast","inline")
#pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define all(x) x.begin(),x.end()
#define rep(i,a,b) for(ll i=a;i<=b;++i)
#define per(i,a,b) for(ll i=a;i>=b;--i)
typedef pair<ll,ll> pll;
const ll N=4e5+5;
ll n,m;
ll a[N];
ll nxt[32][N],cnt[32][N],pre[32][N];
struct Seg
{
    ll tr[N<<2];
    #define ls(x) (x<<1)
    #define rs(x) (x<<1|1)
    #define mid ((l+r)>>1)
    void pushup(ll p)
    {
        tr[p]=max(tr[ls(p)],tr[rs(p)]);
        return ;
    }
    void build(ll p,ll l,ll r,ll i)
    {
        if(l==r)
        {
            tr[p]=nxt[i][l];
            return ;
        }
        build(ls(p),l,mid,i);
        build(rs(p),mid+1,r,i);
        pushup(p);
    }
    ll query(ll p,ll l,ll r,ll ql,ll qr)
    {
        if(l>qr||r<ql)return 0;
        if(l>=ql&&r<=qr)return tr[p];
        return query(ls(p),l,mid,ql,qr)+query(rs(p),mid+1,r,ql,qr);
    }
}T[32];
pll check(ll l,ll r)
{
    ll res=0,mx=-1;
    vector<ll>v;
    rep(i,0,30)if(cnt[i][r]-cnt[i][l-1]!=0)
    {
        res|=1LL<<i;
        if(cnt[i][r]-cnt[i][l-1]==1)v.pb(pre[i][r]);
        mx=max(mx,i);
    }
    sort(all(v));
    unique(all(v));
    ll kl=-1,kr=-1,now=0,rr=res;
    while(rr)
    {
        if(rr%2==0)
        {
            if(!~kl)kl=now;
            kr=now;
        }
        ++now;
        rr/=2;
    }
    if(!~kl)return (make_pair)((1LL<<(mx+1))-1,0LL);
    ll lst=l;
    for(auto x:v)
    {
        if(x-1>=lst)
        {
            if(T[kl].query(1,1,n,lst,x-1)>=kr)return (make_pair)((1<<(mx+1))-1,1LL);
        }
        ll rm=0,mxx=-1;
        rep(i,0,30)if(cnt[i][r]-cnt[i][x]+cnt[i][x-1]-cnt[i][l-1]>0)
        {
            rm|=1LL<<i;
            mxx=max(mxx,i);
        }
        ll kll=-1,krr=-1,noww=0,rrr=rm;
        while(rrr)
        {
            if(rrr%2==0)
            {
                if(!~kll)kll=noww;
                krr=noww;
            }
            ++noww;
            rrr/=2;
        }
        if(mx==mxx)
        {
            if(nxt[kll][x]>=krr)return (make_pair)((1<<(mx+1))-1,1LL);
        }
        else
        {
            if(!~kll)
            {
                if(nxt[mxx+1][x]>=max(mx,krr))return (make_pair)((1<<(mx+1))-1,1LL);
            }
            else if(nxt[kll][x]>=max(mx,krr))return (make_pair)((1<<(mx+1))-1,1LL);
        }
        lst=x+1;
    }
    if(r>=lst&&T[kl].query(1,1,n,lst,r)>=kr)return (make_pair)((1<<(mx+1))-1,1LL);
    return (make_pair)((1<<(mx+1))-1,2LL);
}
int	 main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
	int t=1;
	cin>>t;
	while(t--)
    {
        cin>>n>>m;
        rep(i,1,n)
        {
            cin>>a[i];
            ll lst=-1;
            per(j,30,0)
            {
                if((a[i]>>j)&1)nxt[j][i]=-1,lst=j;
                else nxt[j][i]=lst;
            }
        }
        rep(i,0,30)T[i].build(1,1,n,i);
        rep(i,1,n)rep(j,0,30)
        {
            if((a[i]>>j)&1)cnt[j][i]=cnt[j][i-1]+1,pre[j][i]=i;
            else cnt[j][i]=cnt[j][i-1],pre[j][i]=pre[j][i-1];
        }
        rep(i,1,m)
        {
            ll l,r;
            cin>>l>>r;
            auto ans=check(l,r);
            cout<<ans.first<<" "<<ans.second<<"\n";
        }
    }
}
/*
1
3 2
10 10 5
1 2
1 3
3 2
10 10 5
1 2
1 3
*/