#include <bits/stdc++.h>

using namespace std;

using ll = long long;

void solve();

int32_t main() {
#ifndef LOCAL
	cin.tie(nullptr)->sync_with_stdio(false);
#endif
	int t = 1;
	cin >> t;
	while (t--) {
		solve();
	}
}

constexpr int mod = 100'000'007, N = 200200;
pair<int, int> a[N];

int rec(int m, int l, int r) {
	if (l == r) {
		return (1ll * (a[l].second - a[l].first + 1) * (a[l].second + a[l].first) / 2) % mod;
	}
	if ((a[l].first & (1 << m)) == (a[r].second & (1 << m))) {
		return rec(m - 1, l, r);
	}
	int l1 = l, r1 = r;
	while (r1 != l1) {
		int mid = (r1 + l1) / 2;
		if (a[mid].second & (1 << m)) {
			r1 = mid;
		} else {
			l1 = mid + 1;
		}
	}
	if ((a[l1].first & (1 << m)) != (a[l1].second & (1 << m)) && l1 != l && l1 != r) {
		return 0;
	}
	if ((a[l1].first & (1 << m)) == (a[l1].second & (1 << m))) {
		return 1ll * rec(m - 1, l, l1 - 1) * rec(m - 1, l1, r) % mod;
	}
	if (l1 == l) {
		a[l1].first &= (1 << m);
		a[l1].first += (1 << m);
		return rec(m - 1, l, r);
	}
	a[l1].second &= (1 << m);
	a[l1].second--;
	return rec(m - 1, l, r);
}

void solve() {
	int m, n;
	cin >> m >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i].first >> a[i].second;
	}
	cout << rec(m, 0, n - 1) << '\n';
}