#include<iostream>
#include<set>
#include<map>
#include<time.h>
#include<random>
#include<vector>
#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 = 1000+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[maxn],r[maxn],v[maxn];
int p[maxn][4],q[maxn][4];
int f[2][maxn][maxn];
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] >> v[i];
		p[r[i]][v[i]] = min(p[r[i]][v[i]],l[i]);
		q[r[i]][v[i]] = max(q[r[i]][v[i]],l[i]);
	}
	for(int i = 0; i <= 1; i++) {
		for(int j = 0; j <= n; j++) {
			for(int k = 0; k <= n; k++) {
				f[i][j][k] = 0;
			}
		}
	}
	f[0][0][0] = 1;
	for(int i = 0; i <= n; i++) {
		for(int j = 0; j <= n; j++) {
			for(int k = 0; k <= n; k++) {
				f[(i&1)^1][j][k] = 0;
			}
		}
		for(int j = 0; j <= n; j++) {
			for(int k = 0; k <= n; k++) {
				if(j >= p[i][1] || k >= p[i][2] || j < q[i][2] || k < q[i][3]) {
					f[i&1][j][k] = 0;
					continue;
				}
				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;
			}
		}
	}
	/*
	for(int i = 0; i <= n; i++) {
		for(int j = 0; j <= n; j++) {
			for(int k = 0; k <= n; k++)
				cout<<f[i][j][k]<<' ';
			cout<<'\n';
		}
		cout<<'\n';
	}
	*/
	ll sum = 0;
	for(int i = 0; i <= n; i++) {
		for(int j = 0; j <= n; j++) {
			sum = (sum + f[n&1][i][j]) % 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取等了没
*/