//Create Time: 2018-05-08 15:22:41
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <sstream>
#include <fstream>
#include <functional>
#include <list>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cctype>
#include <ctime>
#include <utility>
#include <complex>
#include <cassert>
#include <climits>
#include <iterator>
#include <tuple>
using namespace std;
#define snuke(i,x) for (__typeof((x).begin()) i = (x).begin(); i != (x).end(); ++i)
#define rep(i,a,n) for (int i=(a);i<(n);i++)
#define per(i,n,a) for (int i=(n)-1;i>=(a);i--)
// #define OUT(x) std::cout<<(#x)<<":"<<(x)<<std::endl
// #define TST(x) std::cout<<(#x)<<":"<<(x)<<" "
#define OUT(args...) {string _s=#args;replace(_s.begin(),_s.end(),',',' ');stringstream _ss(_s);istream_iterator<string> _it(_ss);OUT_TST("\n",_it,args);}
#define TST(args...) {string _s=#args;replace(_s.begin(),_s.end(),',',' ');stringstream _ss(_s);istream_iterator<string> _it(_ss);OUT_TST("",_it,args);}
#define SZ(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
#define unq(x) sort(all(x)),(x).erase(unique(all(x)),(x).end())
#define mem(f,x) memset((f), (x), sizeof(f))
#define clr(f) mem(f,0)
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define mt make_tuple
#define eb emplace_back
#define DEBUG
void OUT_TST(string s,istream_iterator<string> it) {cerr<<s;}
template<typename T, typename... Args> void OUT_TST(string s,istream_iterator<string> it,T a,Args... args){cerr<<*it<<"="<<a<<" ";OUT_TST(s,++it,args...);}
template<class T> void rd(T&ret){ret=0;bool ok=0,u=0;for(;;){int c=getchar();if(c>='0'&&c<='9')ret=(ret<<3)+(ret<<1)+c-'0',ok=1;else if(c=='-')u=1;else if(ok){if(u)ret*=-1;return;}}}
long long powmod(long long p,long long n,long long mod){long long ret=1;for(;n;n>>=1){if(n&1)ret=ret*p%mod;p=p*p%mod;}return ret;}
template <class T> bool chmin(T& a, const T &b) {return b < a? a = b, 1: 0;}
template <class T> bool chmax(T& a, const T &b) {return b > a? a = b, 1: 0;}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii > vii;
typedef tuple<int,int,int> tp;
/****head****/
const int N=333;
const ll mod=(ll)1e9+7;
int dp[N][N][N];
vii qn[N];
void add(int &a,int b){
    a+=b;if(a>=mod) a-=mod;
}
bool ok(int x,int y,int z){
    for(auto i:qn[x]){
        int cnt=i.y-1;
        if(y>=i.x)--cnt;
        if(z>=i.x)--cnt;
        if(cnt!=0)return 0;
    }
    return 1;
}
int main(){
    int n,m;cin>>n>>m;
    rep(i,0,m){
        int l,r,x;cin>>l>>r>>x;
        qn[r].eb(l,x);
    }
    dp[1][0][0]=3;
    // for(auto i:qn[1]){
        // if(i.y!=1){
            // puts("0");return 0;
        // }
    // }
    rep(i,1,n+1)rep(j,0,i)rep(k,0,j+1)if(dp[i][j][k]){
        // OUT(i,j,k,dp[i][j][k]);
        if(!ok(i,j,k)){
            // OUT(i,j,k);
            dp[i][j][k]=0;continue;
        }
        add(dp[i+1][j][k],dp[i][j][k]);
        add(dp[i+1][i][k],dp[i][j][k]);
        add(dp[i+1][i][j],dp[i][j][k]);
        // if(i==2&&j==1&&k==0)OUT(dp[3][2][1]);
    }
    ll ans=0;
    rep(i,0,n+1)rep(j,0,n+1)ans+=dp[n][i][j];
    ans%=mod;
    cout<<ans<<endl;
    return 0;
}


Measured memory_bytes: 129280