#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf INT_MAX
#define fr(i,l,r) for (i=(l); i<=(r); i++)
#define rfr(i,l,r) for (i=(l); i>=(r); i--)
template<typename T>inline void read(T &n){
    T w=1; n=0; char ch=getchar();
    while (!isdigit(ch) && ch!=EOF){ if (ch=='-') w=-1; ch=getchar(); }
    while (isdigit(ch) && ch!=EOF){ n=(n<<3)+(n<<1)+(ch&15); ch=getchar(); }
    n*=w;
}
template<typename T>inline void write(T x){
    if (x==0){ putchar('0'); return ; }
    T tmp;
    if (x>0) tmp=x;
    else tmp=-x;
    if (x<0) putchar('-');
    char F[105];
    long long cnt=0;
    while (tmp){
        F[++cnt]=tmp%10+48;
        tmp/=10;
    }
    while (cnt) putchar(F[cnt--]);
}
#define Min(x,y) x = min(x,y)
#define Max(x,y) x = max(x,y)
//基础配置=================================================================================
const ll N = 100005 , A = 35;
ll n,m,q,ans=0,x,y,l,r,s,z;
ll a[N];
ll sum[N][A];
struct infor{
    ll f[A];
    void clear(){
        memset(f,0,sizeof(f));
    }
    void insert(ll x){
        ll i;
        fr(i,0,30)
            Max(f[i],x^(x-(1ll<<i)));
    }
};
infor operator + (infor x,const infor y){
    ll i;
    fr(i,0,30)
        Max(x.f[i],y.f[i]);
    return x;
}
struct ST{
    ll lg[N];
    infor f[N][21];
    void init(){
        ll i,j;
        lg[1] = 0;
        fr(i,2,n) lg[i] = lg[i>>1]+1;
        fr(i,1,n){
            f[i][0].clear();
            f[i][0].insert(a[i]);
        }
        for (i=1; (1ll<<i)<=n; i++)
            fr(j,1,n-(1ll<<i)+1)
                f[i][j] = f[i-1][j] + f[i-1][j+(1<<i-1)];
    }
    infor qry(ll l,ll r){
        ll k = lg[r-l+1];
        return f[l][k] + f[r-(1<<k)+1][k];
    }
};
ST t;
void init(){
    ll i,j;
    fr(i,0,n+1)
        memset(sum[i],0,sizeof(sum[i]));
    fr(i,1,n){
        fr(j,0,30) sum[i][j] = sum[i-1][j];
        fr(j,0,30)
            if (a[i]&(1ll<<j)) sum[i][j]++;
    }
    t.init();
}
void work(ll l,ll r){
    ll i,j;
    ll cnt=0,pos[A];
    ll ans = 0;
    fr(i,0,30)
        if (sum[r][i]!=sum[l-1][i]) ans = (1ll<<i+1)-1;
    write(ans); putchar(' ');
    bool flag = true;
    fr(i,0,30)
        if ((1ll<<i)<=ans && sum[r][i]==sum[l-1][i]) flag = false;
    if (flag){ printf("0\n"); return ; }
    fr(i,0,30){
        if (sum[r][i]-sum[l-1][i]!=1) continue;
        ll lf,rh,mid;
        lf = l; rh = r;
        while (lf<rh){
            mid = (lf+rh)>>1;
            if (sum[mid][i]-sum[l-1][i]==1) rh = mid;
            else lf = mid+1;
        }
        pos[++cnt] = lf;
    }
    sort(pos+1,pos+1+cnt);
    ll len = 1;
    fr(i,2,cnt)
        if (pos[i]!=pos[len]) pos[++len] = pos[i];
    cnt = len;
    infor f; f.clear();
    ll ls = l;
    fr(i,1,cnt){
        if (pos[i]<=ls) continue;
        if (ls<pos[i]) f = f + t.qry(ls,pos[i]-1);
        Max( ls , pos[i]+1 );
    }
    if (ls<=r) f = f + t.qry(ls,r);
    ll v[A];
    fr(i,1,cnt) v[i] = a[pos[i]];
    // f + v
    ll b1[A],b2[A];
    b1[0] = b2[cnt+1] = 0;
    fr(i,1,cnt) b1[i] = b1[i-1] | v[i];
    rfr(i,cnt,1) b2[i] = b2[i+1] | v[i];
    ll dlt = 0;
    fr(i,0,30)
        if (sum[r][i]-sum[l-1][i]<=1) dlt |= 1ll<<i;
    fr(i,0,30){
        if (f.f[i]==dlt){
            printf("1\n");
            return ;
        }
    }
    fr(i,1,cnt){
        ll dv = b1[i-1] | b2[i+1];
        fr(j,0,30){
            ll vv = v[i] ^ (v[i]-(1ll<<j));
            vv |= dv;
            if (vv==dlt){
                printf("1\n");
                return ;
            }
        }
    }
    printf("2\n");
    return ;
}
void solve(){
    ll i,j;
    read(n); read(q);
    fr(i,1,n) read(a[i]);
    init();
    while (q--){
        read(l); read(r);
        work(l,r);
        // ll ans = calc(l,r);
        // write(ans); putchar('\n');
    }
}
int main(){
	// freopen("a.in","r",stdin);
//	freopen(".out","w",stdout);
    ll qt;
    read(qt);
    while (qt--) solve();
    return 0;
}
//g++ a.cpp -o a -Wall -Wl,--stack=5120000000