#include<bits/stdc++.h>
using std::cin;
using std::cout;
const int N = 1000005;
using ll = long long;
int st[20][N];
int a[N];

int qor(int l, int r) {
	if(l > r) return 0;
	const int lg = std::__lg(r - l + 1);
	return st[lg][l] | st[lg][r - (1 << lg) + 1];
}
std::vector<int> start[30][30];

int main() {
#ifdef zqj
	//freopen("$.in", "r", stdin);
#endif
	std::ios::sync_with_stdio(false), cin.tie(0);
	int T, n, q;
	cin >> T;
	for(int i = 0;i < T;++i) {
		cin >> n >> q;
		for(int i = 1;i <= n;++i) {
			cin >> a[i];
			st[0][i] = a[i];
			int x = a[i];
			for(int j = 0;j < 30;++j) {
				if(x >> j & 1) {
					int k = j - 1;
					for(;k >= 0 && (x >> k & 1) == 0;)
						-- k;
					++ k;
					for(int l = k;l <= j;++l) start[l][j].push_back(i);
				}
			}
		}
		for(int i = 1;i < 20;++i) {
			for(int j = 1;j + (1 << i) - 1 <= n;++j) {
				st[i][j] = st[i - 1][j] | st[i - 1][j + (1 << (i - 1))];
			}
		}
		for(int i = 0, l, r;i < q;++i) {
			cin >> l >> r;
			int ans = qor(l, r);
			if(!ans) {
				cout << ans << ' ' << 0 << '\n';
				continue;
			}
			int max = 30;
			for(;!(ans >> max) & 1;) -- max;
			++ max;
			int out = (1u << max) - 1;
			if(ans == out) {
				cout << ans << ' ' << 0 << '\n';
				continue;
			}
			int ok = 0;
			int L = -1, R = -1;
			for(int i = 0;i < max;++i) {
				if((ans >> i & 1) == 0) {
					if(L < 0) L = i;
					R = i;
				}
			}
			int v = 0;
			for(int i = L;i <= R;++i) v |= 1 << i;
			for(int i = R;i < 30;++i) {
				v |= 1 << i;
				auto & o = start[L][i];
				auto iter = lower_bound(o.begin(), o.end(), l);
				for(;iter != o.end() && *iter <= r;++iter) {
					int x = *iter;
					if((qor(l, x - 1) | v | qor(x + 1, r)) == out) {
						ok = 1;
						break;
					}
				}
				if(ok) break;
			}
			if(ok) {
				cout << out << ' ' << 1 << '\n';
			} else {
				cout << out << ' ' << 2 << '\n';
			}
		}
		for(int i = 0;i < 30;++i)
			for(int j = 0;j < 30;++j)
				start[i][j].clear();
	}
}