#include <bits/stdc++.h>
 
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
 
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)
 
#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
 
// #define DEBUG
 
#ifdef DEBUG
    #define dump(...) fprintf(stderr, __VA_ARGS__)
#else
    #define dump(...)
#endif
 
template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}
 
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
 
const double EPS = 1e-10;
const double PI = acos(-1.0);
const ll inf =1LL << 62;
const ll mod=1000000007LL;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
 
 
ll extgcd(ll a,ll b,ll& x,ll& y){x=1,y=0;ll g=a;if(b!=0) g=extgcd(b,a%b,y,x),y-=a/b*x;return g;}
ll ADD(const ll &a, const ll &b,const ll &mod) { return (a+b)%mod;}
ll SUB(const ll &a, const ll &b,const ll &mod) { return (a-b+mod)%mod;}
ll MUL(const ll &a, const ll &b,const ll &mod) { return (1LL*a*b)%mod;}
ll DIV(const ll &a, const ll &b,const ll &mod) {ll x,y; extgcd(b,mod,x,y);return MUL(a,(x+mod)%mod,mod);}
 
random_device rd;
mt19937 mt(rd());
uniform_int_distribution<int> dice(1,6);
uniform_real_distribution<double> score(0.0,10.0);

using LX = tuple<int, int>;
vector<vector<LX>> conds;

vector<vector<vi>> dp;
int used[301][301][301];

inline void update(vi pi, int i){
    if(used[pi[0]][pi[1]][pi[2]]) return;
    used[pi[0]][pi[1]][pi[2]] = true;
    int cur = dp[pi[0]][pi[1]][pi[2]];
    if(cur == 0) return;

    rep(k, 3){
        bool ok = true;
        for(auto& e : conds[i]){
            int l, x; tie(l, x) = e;
            int cnt = 0;
            rep(j, 3){
                if(j == k) cnt++;
                else cnt += (pi[j] >= l ? 1:0);
            }
            if(cnt != x){ ok = false; break; }
        }
        if(not ok) continue;

        int& nxt = dp[k==0 ? i+1:pi[0]][k==1 ? i+1:pi[1]][k==2 ? i+1:pi[2]];
        nxt = ADD(nxt, cur, mod);
    }
}

int main(void){
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n, m; cin >> n >> m;
    conds = vector<vector<LX>>(n);
    rep(i, m){
        int l, r, x; cin >> l >> r >> x; l, r--;
        conds[r].emplace_back(LX(l, x));
    }

    dp = vector<vector<vi>>(n + 1, vector<vi>(n + 1, vi(n + 1)));
    dp[0][0][0] = 1;

    rep(i, n){
        rep(c1, i + 1){
            rep(c2, i + 1){
                update({i, c1, c2}, i);
                update({c1, i, c2}, i);
                update({c1, c2, i}, i);
            }
        }
    }

    ll res = 0;
    rep(c1, n){
        rep(c2, n){
            res = ADD(res, dp[n][c1][c2], mod);
            res = ADD(res, dp[c1][n][c2], mod);
            res = ADD(res, dp[c1][c2][n], mod);
        }
    }

    cout << res << endl;

    return 0;
}


Measured memory_bytes: 216832