#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define sz(a) ((int) (a).size())
#define ll long long 
#define vi vectoe<int>
#define pb emplace_back
using namespace std;

#define VP vector<pair<int,int>>
const int N = 1 << 19, mod = 1e9 + 7;
int m, n;
int solve(int n, VP ps, int l) {
	if(sz(ps) == 1) {
		int sum = 0;
		L(i, l, l + (1 << n) - 1) (sum += i) %= mod;
		return sum;
	}
	int p = 0;
	while(ps[p].second < l + (1 << (n - 1))) ++p;
	if(ps[p].first == l + (1 << (n - 1))) {
		VP ls, rs;
		L(i, 0, p - 1) ls.pb(ps[i]);
		L(i, p, sz(ps) - 1) rs.pb(ps[i]);
		return (ll) solve(n - 1, ls, l) * solve(n - 1, rs, l + (1 << (n - 1))) % mod;
	} else if(p == 0) {
		VP rs;
		L(i, p, sz(ps) - 1) rs.pb(ps[i]);
		rs[0].first = l + (1 << (n - 1));
		return solve(n - 1, rs, l + (1 << (n - 1)));
	} else if(p == sz(ps) - 1) {
		VP ls;
		L(i, 0, p) ls.pb(ps[i]);
		ls.back().second = l + (1 << (n - 1)) - 1;
		return solve(n - 1, ls, l);
	} else {
		return 0;
	}
}
void Main() {
	cin >> n >> m;
	vector<pair<int,int>>vp;
	L(i, 1, m) {
		int l, r;
		cin >> l >> r;
		vp.pb(l, r);
	}
	cout << solve(n, vp, 0) << '\n';
}
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int t; cin >> t; while(t--) Main();
	return 0;
}