#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<"("<<p.fs<<","<<p.sc<<")";}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<"sz = "<<vc.size()<<endl<<"[";for(const T& v:vc) o<<v<<",";o<<"]";return o;}
template<unsigned int mod_>
struct ModInt{
	using uint = unsigned int;
	using ll = long long;
	using ull = unsigned long long;

	constexpr static uint mod = mod_;

	uint v;
	ModInt():v(0){}
	ModInt(ll v):v(normS(v%mod+mod)){}
	explicit operator bool() const {return v!=0;}
	static uint normS(const uint &x){return (x<mod)?x:x-mod;}		// [0 , 2*mod-1] -> [0 , mod-1]
	static ModInt make(const uint &x){ModInt m; m.v=x; return m;}
	ModInt operator+(const ModInt& b) const { return make(normS(v+b.v));}
	ModInt operator-(const ModInt& b) const { return make(normS(v+mod-b.v));}
	ModInt operator-() const { return make(normS(mod-v)); }
	ModInt operator*(const ModInt& b) const { return make((ull)v*b.v%mod);}
	ModInt operator/(const ModInt& b) const { return *this*b.inv();}
	ModInt& operator+=(const ModInt& b){ return *this=*this+b;}
	ModInt& operator-=(const ModInt& b){ return *this=*this-b;}
	ModInt& operator*=(const ModInt& b){ return *this=*this*b;}
	ModInt& operator/=(const ModInt& b){ return *this=*this/b;}
	ll extgcd(ll a,ll b,ll &x,ll &y) const{
		ll u[]={a,1,0},v[]={b,0,1};
		while(*v){
			ll t=*u/ *v;
			rep(i,3) swap(u[i]-=t*v[i],v[i]);
		}
		if(u[0]<0) rep(i,3) u[i]=-u[i];
		x=u[1],y=u[2];
		return u[0];
	}
	ModInt inv() const{
		ll x,y;
		extgcd(v,mod,x,y);
		return make(normS(x+mod));
	}
	bool operator==(const ModInt& b) const { return v==b.v;}
	bool operator!=(const ModInt& b) const { return v!=b.v;}
	friend istream& operator>>(istream &o,ModInt& x){
		ll tmp;
		o>>tmp;
		x=ModInt(tmp);
		return o;
	}
	friend ostream& operator<<(ostream &o,const ModInt& x){ return o<<x.v;}
};
using mint = ModInt<1000000007>;

mint dp[301][302][302];

vector<int> r2ls[301],r2xs[301];

int N,M;
int main(){
	cin>>N>>M;
	rep(i,M){
		int l,r,x;
		cin>>l>>r>>x;
		l--;
		r2ls[r].pb(l);
		r2xs[r].pb(x);
	}
	dp[1][0][0] = 3;
	rep1(i,N){
		int K = r2ls[i].size();
		rep(q,K){
			int l = r2ls[i][q];
			int x = r2xs[i][q];
			rep(p_,N+1) rep(pp_,N+1){
				int p = p_-1;
				int pp = pp_-1;
				int cnt = 1;
				if(l<=p) cnt++;
				if(l<=pp) cnt++;
				if(cnt!=x) dp[i][p_][pp_] = 0;
			}
		}
		if(i==N) break;
		rep(p_,N+1) rep(pp_,N+1) if(dp[i][p_][pp_]){
			mint &val = dp[i][p_][pp_];
			int p = p_-1;
			int pp = pp_-1;
			int x = i-1;
			dp[i+1][p+1][pp+1] += val;	//add x
			if(p==-1){
				dp[i+1][x+1][0] += val*2;
			}else if(pp==-1){
				dp[i+1][x+1][0] += val;
				dp[i+1][x+1][p+1] += val;
			}else{
				dp[i+1][x+1][pp+1] += val;
				dp[i+1][x+1][p+1] += val;
			}
		}
	}
	mint ans = 0;
	rep(p,N+2) rep(pp,N+2) ans += dp[N][p][pp];
	cout<<ans<<endl;
}


Measured memory_bytes: 107520