#include<bits/stdc++.h>
using namespace std;
#define next Next
#define last Last
#define int long long
const int mod=1e9+7;
const int N=305;
int n,m,f[N][N][N];
struct node{
	int x,y;
};
vector<node>g[N];
/*char buf[1<<21],*p1=buf,*p2=buf;
inline int gc(){return p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++;}*/
#define gc getchar
inline int read()
{
	int ret=0,f=0;char c=gc();
	while(!isdigit(c)){if(c=='-')f=1;c=gc();}
	while(isdigit(c)){ret=ret*10+c-48;c=gc();}
	if(f)return -ret;return ret;
}
signed main()
{
	n=read();m=read();
	for(int i=1;i<=m;i++)
	{
		int l=read(),r=read(),x=read();
		g[r].push_back((node){l,x});
	}
	f[0][0][0]=1;
	for(int i=1;i<=n;i++)
		for(int j=0;j<i;j++)
			for(int k=0;k<=j;k++)
			{
				f[i][j][k]=(f[i][j][k]+f[i-1][j][k])%mod;
				f[i][i-1][k]=(f[i][i-1][k]+f[i-1][j][k])%mod;
				f[i][i-1][j]=(f[i][i-1][j]+f[i-1][j][k])%mod;
				for(int p=0;p<g[i].size();p++)
				{
					node u=g[i][p];
					int gs=1+(j>=u.x)+(k>=u.x);
					if(gs!=u.y)f[i][j][k]=0;
				}
			}
	int ans=0;
	for(int i=0;i<n;i++)
		for(int j=0;j<=i;j++)ans=(ans+f[n][i][j])%mod;
	cout<<ans;
	return 0;
}