#include<iostream>
#include<set>
#include<map>
#include<time.h>
#include<random>
#include<vector>
#include<queue>
#include<iomanip>
#include<string.h>
#include<algorithm>
#include<unordered_map>
#include<unordered_set>
using namespace std;
//#pragma optimize(2)
#define fi first
#define se second
#define ll long long
#define ull unsigned ll
#define str string
#define db double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pq priority_queue
#define pqMax(x) pq< x >
#define pqMin(x) pq< x ,vector< x >,greater< x > >
#define MP make_pair
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define lowbit(x) ((x)&(-(x)))
#define sz(x) ((int) (x).size())
#define ms(a,t) memset(a,t,sizeof(a))
#define FORe(i, u, v) for (int i = h[u], v; v = e[i].to, i; i = e[i].nxt)
const ll INF = 0x3f3f3f3f;
const int maxn = 5000+10;
const int maxm = 1e6+10;
const ll mod = 1e9+7;
const db eps = 1e-6;
//ll read() {
//	ll x=0,f=1;char ch=getchar();
//	while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
//	while (ch>='0'&&ch<='9'){x=x*10+ch-48;ch=getchar();}
//	return x*f;
//}
int n,m;
int l[maxm],r[maxm],val[maxm];
int p[maxn][4],q[maxn][4];
int f[2][maxn],g[2][maxn];
deque<pii > v[maxn];
int vec[maxn];
void del(int &x,int y) {
	x -= y; x += (x >> 31) & mod;
}
void add(int &x,int y) {
	x += y-mod; x += (x >> 31) & mod;
}
void print() {
	for(int i = 0;i <= n; i++) {
		for(int j = 0; j <= n; j++) vec[j] = 0;
		for(pii x : v[i]) {
			vec[x.fi] = x.se;
		}
		for(int j = 0; j <= n; j++) {
			cout<<vec[j]<<' ';
		}
		cout<<'\n';
	}
	cout<<'\n';
}
void Solve() {
	cin >> n >> m;
	for(int i = 0; i <= n; i++) p[i][1] = p[i][2] = p[i][3] = i+1;
	for(int i = 1; i <= n; i++) q[i][1] = q[i][2] = q[i][3] = 0;
	for(int i = 1; i <= m; i++) {
		cin >> l[i] >> r[i] >> val[i];
		p[r[i]][val[i]] = min(p[r[i]][val[i]],l[i]);
		q[r[i]][val[i]] = max(q[r[i]][val[i]],l[i]);
	}
	for(int i = 0; i <= n; i++) v[i].clear();
	for(int j = 0; j <= n; j++) { f[0][j] = 0; }
	for(int k = 0; k <= n; k++) { g[0][k] = 0; }
	f[0][0] = 1; g[0][0] = 1;
	for(int i = 0; i <= n; i++) {
		for(int j = 0; j <= i; j++) {
			if(q[i][2] <= j && j < p[i][1]) {
//				cout<<f[i&1][j]<<'\n';
				while(!v[j].empty() && v[j].front().fi < q[i][3]) {
					del(f[i&1][j],v[j].front().se);
					del(g[i&1][v[j].front().fi],v[j].front().se);
					v[j].pop_front();
				}
				while(!v[j].empty() && v[j].back().fi >= p[i][2]) {
					del(f[i&1][j],v[j].back().se);
					del(g[i&1][v[j].back().fi],v[j].back().se);
					v[j].pop_back();
				}
			} else {
				for(pii x : v[j]) {
					del(f[i&1][j],x.se);
					del(g[i&1][x.fi],x.se);
				}
				v[j].clear();
			}
		}
//		for(int j = 0; j <= n; j++) cout<<f[i&1][j]<<' '; cout<<'\n';
//		for(int k = 0; k <= n; k++) cout<<g[i&1][k]<<' '; cout<<'\n';
//		cout<<"----\n";
//		print();
		if(i == n) continue;
		bool to = (i&1)^1;
		for(int j = 0; j <= n; j++) {
			f[to][j] = f[i&1][j];
		}
		for(int k = 0; k <= n; k++) {
			g[to][k] = g[i&1][k];
		}
		for(int j = 0; j <= n; j++) vec[j] = 0;
		for(int j = q[i][2]; j < p[i][1]; j++) {
			add(vec[j],f[i&1][j]);
			add(f[to][i],f[i&1][j]);
			add(g[to][j],f[i&1][j]);
		}
		for(int k = q[i][3]; k < p[i][2]; k++) {
			add(vec[k],g[i&1][k]);
			add(f[to][i],g[i&1][k]); // i*k -> i+1,i,k
			add(g[to][k],g[i&1][k]);
		}
		if(i == 0) vec[0]++;
		for(int j = 0; j <= n; j++) {
			if(vec[j] != 0) v[i].push_back(MP(j,vec[j]));
		}
/*
			f[(i&1)^1][j][k] = (f[(i&1)^1][j][k] + f[i&1][j][k]) % mod; 
			f[(i&1)^1][i][k] = (f[(i&1)^1][i][k] + f[i&1][j][k]) % mod;
			f[(i&1)^1][i][j] = (f[(i&1)^1][i][j] + f[i&1][j][k]) % mod;
*/
	}
//	print();
	ll sum = 0;
	for(int i = q[n][2]; i < p[n][1]; i++) {
		sum = (sum + f[n&1][i]) % mod;
	}
	cout<<sum<<'\n';
}
int main() {
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int tt; cin >> tt ; while(tt--)
	Solve();
	return 0;
}
/*
调试先查四件事
1. 数组开够没
2. ijk写错没
3. int爆了没
4. double取等了没
*/