#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5;

int pre[N][30], mn[N][30], a[N];
int T, n, q;

int p[30][N << 2];
void build(int id, int u, int l, int r) {
	if (l == r) {
		p[id][u] = mn[l][id];
		return;
	}
	int mid = (l + r) >> 1;
	build(id, u << 1, l, mid);
	build(id, u << 1 | 1, mid + 1, r);
	p[id][u] = min(p[id][u << 1], p[id][u << 1 | 1]);
}

int query(int id, int u, int L, int R, int l, int r) {
	if (l <= L && R <= r) return p[id][u];
	int mid = (L + R) >> 1, ans = 1e9;
	if (mid >= l) ans = query(id, u << 1, L, mid, l, r);
	if (mid + 1 <= r) ans = min(ans, query(id, u << 1 | 1, mid + 1, R, l, r));
	return ans;
}

int main() {
	scanf("%d", &T);
	while (T--) {
		scanf("%d%d", &n, &q);
		for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
		for (int i = 1; i <= n; i++) {
			memcpy(pre[i], pre[i - 1], sizeof(pre[i]));
			memset(mn[i], 0x3f, sizeof(mn[i]));
			int last = -1;
			for (int j = 0; j < 30; j++) {
				if (a[i] >= (1 << j)) mn[i][j] = last + 1;
				if ((a[i] >> j) & 1) {
					pre[i][j] = i;
					last = j;
				}
			}
		}
		for (int i = 0; i < 30; i++) build(i, 1, 1, n);
		while (q--) {
			int l, r;
			scanf("%d%d", &l, &r);
			int cnt = 0, high = -1;
			for (int i = 0; i < 30; i++) {
				if (pre[r][i] >= l) {
					++cnt;
					high = i;
				}
			}
			if (cnt == high + 1) {
				if (high == -1) printf("0 0\n");
				else printf("%d 0\n", (1 << (high + 1)) - 1);
				continue;
			}
			printf("%d ", (1 << (high + 1)) - 1);
			vector <int> vec;
			int ll = -1, rr = -1, bad = 0;
			for (int i = 0; i <= high; i++) {
				if (pre[r][i] < l) {
					if (ll == -1) ll = i;
					rr = i;
				} else {
					if (pre[pre[r][i] - 1][i] < l) {
						vec.push_back(pre[r][i]);
						bad |= (1 << i);
					}
				}
			}
			sort(vec.begin(), vec.end());
			auto check = [&](int L, int R) {
				if (L > R) return false;
				// fprintf(stderr, "L = %d, R = %d, val = %d\n", L, R, query(rr, 1, n, 1, L, R));
				return query(rr, 1, n, 1, L, R) <= ll;
			};
			int ans = 0, now = l;
			int tmp = 0;
			for (int i = ll; i <= rr; i++) tmp |= (1 << i);
			for (auto i : vec) {
				int need = (a[i] & bad) | tmp;
				if (a[i] >= (1 << ll) && ((a[i] ^ (a[i] - (1 << ll))) & need) == need) {
					ans = 1;
					break;
				}
				ans |= check(now, i - 1);
				now = i + 1;
			}
			ans |= check(now, r);
			printf("%d\n", ans ? 1 : 2);
		}
	}
	return 0;
}