#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
template<class T>void chmax(T &a,T b){if(a<b)a=b;}
template<class T>void chmin(T &a,T b){if(a>b)a=b;}
constexpr int INF=1000000000000000000;
constexpr int mod=1000000007;
constexpr double eps=1e-12;
const double pi=acos(-1);
//int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
int Random(int mi,int ma){
    random_device rnd;
    mt19937 mt(rnd());//32bit
    //[mi,ma]
    uniform_int_distribution<int>engine(mi,ma);
    return engine(mt);
}
int gcd(int a,int b){
    if(b==0)return a;
    return gcd(b,a%b);
}
int lcm(int a,int b){
    return a/gcd(a,b)*b;
}
bool prime(int a){
    if(a==1)return false;
    for(int i=2;i*i<=a;i++){
        if(a%i==0)return false;
    }
    return true;
}
int modpow(int a,int b){
    if(b==0)return 1;
    if(b%2)return modpow(a,b-1)*a%mod;
    int memo=modpow(a,b/2);
    return memo*memo%mod;
}
vector<int>kaijo,invkaijo;
void init_fact(int n){
    kaijo.resize(n+1);
    invkaijo.resize(n+1);
    kaijo[0]=1;
    for(int i=1;i<=n;i++){
        kaijo[i]=kaijo[i-1]*i;
        kaijo[i]%=mod;
    }
    rep(i,n+1)invkaijo[i]=modpow(kaijo[i],mod-2);
}
int comb(int a,int b){
    if(a<b)return 0;
    if(a<0||b<0)return 0;
    return kaijo[a]*modpow(kaijo[a-b],mod-2)%mod*modpow(kaijo[b],mod-2)%mod;
}
int inv(int x){
    x=modpow(x,mod-2);
    return x;
}
int n,m,dp[310][310][310];
vector<P>v[310];
signed main(){
    cin.tie(0);ios::sync_with_stdio(false);
    cin>>n>>m;
    rep(i,m){
        int l,r,x;
        cin>>l>>r>>x;
        v[r].pb({l,x});
    }
    dp[0][0][0]=1;
    rep(i,n){
        rep(j,n){
            rep(k,n){
                int pos=max({i,j,k})+1;
                {
                    for(P p:v[pos]){
                        int cnt=1;
                        if(p.fi<=j)cnt++;
                        if(p.fi<=k)cnt++;
                        if(cnt!=p.se)goto ng1;
                    }
                    dp[pos][j][k]+=dp[i][j][k];
                    dp[pos][j][k]%=mod;
                    ng1:;
                }
                {
                    for(P p:v[pos]){
                        int cnt=1;
                        if(p.fi<=i)cnt++;
                        if(p.fi<=k)cnt++;
                        if(cnt!=p.se)goto ng2;
                    }
                    dp[i][pos][k]+=dp[i][j][k];
                    dp[i][pos][k]%=mod;
                    ng2:;
                }
                {
                    for(P p:v[pos]){
                        int cnt=1;
                        if(p.fi<=i)cnt++;
                        if(p.fi<=j)cnt++;
                        if(cnt!=p.se)goto ng3;
                    }
                    dp[i][j][pos]+=dp[i][j][k];
                    dp[i][j][pos]%=mod;
                    ng3:;
                }
            }
        }
    }
    int ans=0;
    rep(i,n+1){
        rep(j,n+1){
            rep(k,n+1){
                if(i==n||j==n||k==n){
                    ans+=dp[i][j][k];
                    ans%=mod;
                }
            }
        }
    }
    cout<<ans<<endl;
    return 0;
}


Measured memory_bytes: 227584