#include<bits/stdc++.h>
#define lc(p) ((p) * 2)
#define rc(p) ((p) * 2 + 1)
using namespace std;
typedef long long ll;
const int N = 1e5 + 5 , T = N * 4 , LG = 30;
int n , q , a[N];
struct Info
{
	int mx = 0 , s = 0 , ans = 0 , cnt[LG] = {}; 
	vector<int>v;
}tr[T];
ostream& operator << (ostream &os , const Info &a)
{
	os << a.mx << ' ' << a.s << ' ' << a.ans << "; ";
	for(int i = 0 ; (1ll << i) < a.mx ; i++)
		os << a.cnt[i] << " ";
	os << "; ";
	for(int x : a.v)os << x << " ";
	return os;
}
Info operator + (const Info &a , const Info &b)
{
	Info c; int s1 = 0 , s0 = 0;
	c.s = a.s | b.s , c.mx = a.mx | b.mx;
	c.ans = min(a.ans , b.ans);
	if(c.s == c.mx)c.ans = 0;
	for(int i = 0 ; i < LG ; i++)
	{
		c.cnt[i] = a.cnt[i] + b.cnt[i];
		if(!c.cnt[i])s0 |= 1 << i;
		if(c.cnt[i] == 1)s1 |= 1 << i;
	}
	auto chk = [&](int x)
	{
		if(!(x & s1))
		{
			if(c.ans <= 1)return ;
			for(int i = 0 ; i < LG ; i++)
			{
				int y = x ^ (x - (1 << i));
				if((s0 & y) == s0)
				{
					c.ans = min(c.ans , 1);
					break ;
				}
			}
		}
		else c.v.push_back(x);
	};
	for(int x : a.v)chk(x);
	for(int x : b.v)chk(x);
	// cerr << "Merge " << a << "\n+\n" << b << "\n";
	// cerr << "=\n" << c << "\n";
	return c;
}
void Pushup(int p){tr[p] = tr[lc(p)] + tr[rc(p)];}
void Build(int l , int r , int p)
{
	if(l == r)
	{
		tr[p].mx = (1ll << (64 - __builtin_clzll(a[l]))) - 1;
		tr[p].s = a[l] , tr[p].ans = 2;
		for(int i = 0 ; i < LG ; i++)
			tr[p].cnt[i] = (a[l] >> i) & 1;
		if(a[l])tr[p].v.push_back(a[l]);
		return ;
	}
	int mid = (l + r) >> 1;
	Build(l , mid , lc(p));
	Build(mid + 1 , r , rc(p));
	Pushup(p);
}
Info Query(int s , int e , int l = 1 , int r = n , int p = 1)
{
	if(s <= l && r <= e)return tr[p];
	int mid = (l + r) >> 1;
	if(s <= mid && mid < e)return Query(s , e , l , mid , lc(p)) + Query(s , e , mid + 1 , r , rc(p));
	else if(s <= mid)return Query(s , e , l , mid , lc(p));
	else return Query(s , e , mid + 1 , r , rc(p));
}
int Solve()
{
	cin >> n >> q;
	for(int i = 1 ; i <= n ; i++)cin >> a[i];
	Build(1 , n , 1);
	while(q--)
	{
		int l , r; cin >> l >> r;
		Info ans = Query(l , r);
		cout << ans.mx << ' ' << ans.ans << "\n";
	}
	return 0;
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0) , cout.tie(0);
	int T; cin >> T;
	while(T--)Solve();
	return 0;
}