#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ignore ignore
#define pb emplace_back
#define mt make_tuple
#define gcd __gcd
#define bitcount(x)  __builtin_popcount(x)
#define bitcountll(x)  __builtin_popcountll(x)
// Input
#define in(a) scanf("%d",&a)
#define in2(a,b) scanf("%d%d",&a,&b)
#define in3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define inp(p) in2(p.F,p.S)
#define llin(a) cin >> a
#define inl(a) scanf("%lld",&a)
#define read(v,i,n) for(i=0;i<n;i++)in(v[i])
#define twod(mat,i,j,n,m) rep(i,n){rep(j,m)in(mat[i][j]);}
#define sc(ch) scanf("%c",&ch)
#define sstr(str) scanf("%s",str)
// Output
#define pr(a) printf("%d ",a)
#define pr2(a,b) printf("%d %d\n",a,b)
#define pr3(a,b,c) printf("%d %d %d\n",a,b,c)
#define prp(p) pr2(p.F,p.S)
#define out(a) printf("%d\n",a)
#define outl(a) printf("%lld\n",a)
#define llpr(a) cout << a << " "
#define llout(a) cout << a << "\n"
#define pinttwod(mat,i,j,n,m) rep(i,n){rep(j,m)pr(mat[i][j]);   lin;}
#define plltwod(mat,i,j,n,m)  rep(i,n){rep(j,m)llpr(mat[i][j]); lin;}
#define byes printf("YES\n")
#define bno printf("NO\n")
#define yes printf("Yes\n")
#define no printf("No\n")
#define lin printf("\n")
// Iterator
#define rep(i,n) for(i=0;i<n;++i)
#define fone(i,n) for(i=1;i<=n;++i)
#define rrep(i,n) for(i=n-1;i>=0;--i)
#define lp(i,a,b) for(i=a;i<b;++i)
#define rlp(i,a,b) for(i=a;i>=b;--i)
#define all(vec) vec.begin(),vec.end()
#define lower(v,k) lower_bound(v.begin(),v.end(),k)-v.begin()
#define upper(v,k) upper_bound(v.begin(),v.end(),k)-v.begin()
#define tf(mytuple) get<0>(mytuple)
#define ts(mytuple) get<1>(mytuple)
#define tt(mytuple) get<2>(mytuple)
// function
#define sz(x) x.size()
#define inrange(i,a,b) (i>=a && i<b)
#define FLUSH fflush(stdout)
#define precision(x) cout << setprecision(x) << fixed
#define remax(a,b) a=max(a,b)
#define remin(a,b) a=min(a,b)
#define lchild(p) 2*p
#define rchild(p) 2*p+1
#define lseg l,m,2*p
#define rseg m+1,h,2*p+1
#define bhardo(mat,i,j,n,m,t) rep(i,n){rep(j,m)mat[i][j]=t;}
#define biton(mask,i)  (mask&(1<<i))
#define bitoff(mask,i) (!(mask&(1<<i)))
// Debug
#define dbg(v,i,n) for(i=0;i<n;i++)pr(v[i]); lin
#define ck printf("continue\n")
#define debug(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args)
{
	cerr << *it << " = " << a << "\n";
	err(++it, args...);
}
// Data Type
#define ll long long int
#define ii pair<int,int>
#define pli pair<ll,int>
#define triple tuple<int,int,int>
#define vi vector<int>
#define vii vector<pair<int,int> >
#define vvi vector<vector<int> >
#define viii vector<pair<pair<int,int>,int> >
#define vvii vector<vector<pair<int,int> > >
// Constant
const double PI = acos(-1);
const double eps = (1e-9);
const ll INF = 2e9;
const int M = (1e9)+7;
const int N = 303;  // check the limit, man
ll dp[N][N][N];
vvii ad(N);
vi v(3);
int check(int r,int g,int b,int k)
{
    v[0]=r,v[1]=g,v[2]=b;
    sort(all(v));
    int l,d;
    for(auto temp : ad[k])
    {
        tie(l,d)=temp;
        if(d==1 && v[1]>=l)
            return 0;
        if(d==2 && (v[0]>=l || v[1]<l))
            return 0;
        if(d==3 && v[0]<l)
            return 0;
    }
    return 1;
}
ll pro(ll a,ll b)
{
    a+=b;
    if(a>=M)
        a-=M;
    return a;
}
void solve()
{
    int n,m,l,d,r,g,b,k;
    in2(n,m);
    while(m--)
    {
        in3(l,r,d);
        ad[r].pb(l,d);
    }
    dp[0][0][0]=1;
    queue<triple> pq;
    pq.push(mt(0,0,0));
    ll ans=0;
    while(!pq.empty())
    {
        tie(r,g,b)=pq.front();
        pq.pop();
        k=max(r,max(g,b));
        if(check(r,g,b,k))
        {
            if(k==n)
            {
                ans+=dp[r][g][b];
                continue;
            }
            if(dp[k+1][g][b]==0)
                pq.push(mt(k+1,g,b));
            if(dp[r][k+1][b]==0)
                pq.push(mt(r,k+1,b));
            if(dp[r][g][k+1]==0)
                pq.push(mt(r,g,k+1));
            dp[k+1][g][b]=pro(dp[k+1][g][b],dp[r][g][b]);
            dp[r][k+1][b]=pro(dp[r][k+1][b],dp[r][g][b]);
            dp[r][g][k+1]=pro(dp[r][g][k+1],dp[r][g][b]);
        }
        else
            dp[r][g][b]=0;
    }
    llout(ans%M);
}
int main()
{
    int t=1;
//    in(t);
    while(t--)
        solve();
}

Measured memory_bytes: 220672