#include <bits/stdc++.h>

using namespace std;

#define io ios_base::sync_with_stdio(false); cin.tie(0); cerr.tie(0)
#define iter(v) v.begin(), v.end()
#define SZ(v) int(v.size())
#define pb emplace_back
#define mp make_pair
#define ff first
#define ss second

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

#ifdef zisk
void debug(){cerr << "\n";}
template<class T, class ... U>
void debug(T a, U ... b){cerr << a << " ", debug(b...);}
template<class T> void pary(T l, T r){
	while(l != r) cerr << *l << " ", l++;
	cerr << "\n";
}
#else
#define debug(...) void()
#define pary(...) void()
#endif
template<class A, class B>
ostream& operator<<(ostream& o, pair<A, B> p){
	return o << '(' << p.ff << ',' << p.ss << ')';
}

const int maxn = 100005;
struct segtree{
	int seg[4*maxn];
	int ma[4*maxn][31];
	void build(int cur, int l, int r, int a[]) {
		if (r <= l) return;
		seg[cur] = 0;	
		if (r - l == 1) {
			seg[cur] = a[l];
			for (int b = 0;b <= 30;b++) ma[cur][b] = b;
			int prv = -1;
			for (int b = 30;b >= 0;b--) {
				if ((a[l]>>b)&1) {
					if (prv != -1) {
						ma[cur][prv] = b+1; //100...0
					}
					prv = b;
				}
			}
			if (prv != -1) ma[cur][prv] = 0;
			return;
		}
		int m = (l + r) / 2;
		build(cur*2, l, m, a), build(cur*2+1, m, r, a);	
		seg[cur] = seg[cur*2] | seg[cur*2+1];
		for (int b = 0;b <= 30;b++) ma[cur][b] = min(ma[cur*2][b], ma[cur*2+1][b]);
	}
	int query(int cur, int l, int r, int ql, int qr, int ret[]) {
		if (r <= l || ql >= r || qr <= l) return 0;
		if (ql <= l && qr >= r) {
			for (int b = 0;b <= 30;b++) ret[b] = min(ret[b], ma[cur][b]);
			return seg[cur];
		}
		int m = (l + r) / 2;
		return query(cur*2, l, m, ql, qr, ret) | query(cur*2+1, m, r, ql, qr, ret);
	}
} seg;

int a[maxn];
int main(){
	io;

	int T;
	cin >> T;
	while (T--) {
		int n, q;
		cin >> n >> q;
		for (int i = 0;i < n;i++) cin >> a[i];
		seg.build(1, 0, n, a);
		while (q--) {
			int l, r;
			cin >> l >> r;
			l--, r--;
			int ranges[31];
			for (int i = 0;i <= 30;i++) ranges[i] = i;
			int val = seg.query(1, 0, n, l, r+1, ranges);
			int hb = 0;
			for (int i = 0;i <=30;i++) {
				if ((val>>i)&1) hb = i;
			}
			int ans = (1<<(hb+1)) - 1;
			if (val == ans) {
				cout << val << " " << 0 << "\n";
			} else {
				
				int mi = 31, ma = 0;
				for (int i = 0;i <= hb;i++) {
					if (!((val>>i)&1)) {
						mi = min(mi, i);
						ma = i;
					}
				}
				//debug(val, ans, mi, ma, ranges[ma]);
				int num = 2;
				for (int i = 29;i >= ma;i--) {
					if (ranges[i] <= mi) num = 1;
				}
				cout << ans << " " << num << "\n";
			}
		}
	}

}