#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000000

int main(){

	int N,M;
	cin>>N>>M;
	
	vector<vector<pair<int,int>>> Q(N+1,vector<pair<int,int>>());
	
	for(int i=0;i<M;i++){
		int l,r,x;
		cin>>l>>r>>x;
		Q[r].emplace_back(l,x);
	}
	
	vector<vector<vector<int>>> dp(N+1,vector<vector<int>>(N+1,vector<int>(N+1,0)));
	dp[0][0][0] = 1;
	
	for(int i=0;i<=N;i++){
		for(int j=0;j<Q[i].size();j++){
			for(int x=0;x<=N;x++){
				for(int y=0;y<=N;y++){
					int t = 1;
					if(x>=Q[i][j].first)t++;
					if(y>=Q[i][j].first)t++;
					if(t!=Q[i][j].second){
						dp[i][x][y]=0;
					}
				}
			}
		}
		if(i==N)break;
		for(int j=0;j<=N;j++){
			for(int k=0;k<=N;k++){
				if(dp[i][j][k]==0)continue;
				int t = dp[i][j][k];
				dp[i+1][j][k] = mod(dp[i+1][j][k]+t);
				dp[i+1][k][i] = mod(dp[i+1][k][i]+t);
				dp[i+1][i][j] = mod(dp[i+1][i][j]+t);
			}
		}
	}
	
	int ans =  0;
	for(int j=0;j<=N;j++){
		for(int k=0;k<=N;k++){
			ans = mod(ans + dp.back()[j][k]);
		}
	}
	cout<<ans<<endl;
	return 0;
}