#include<bits/stdc++.h>

using namespace std;

const int mod = 1e9 + 7;
const int maxn = 305;
typedef pair<int, int> pii;

vector<pii> qe[maxn];
int dp[maxn][maxn][maxn];
int n;

int perform(int r, int g, int b){
  int i = max(r, max(g, b));
  int & ans = dp[r][g][b];
  if(ans != -1){
    return ans;
  }
  ans = 0;
  for(pii q : qe[i]){
    int ct = 0;
    if(r >= q.first) ct++;
    if(g >= q.first) ct++;
    if(b >= q.first) ct++;
    if(ct != q.second) return ans;
  }
  if(i == n){
    ans = 1;
    return 1;
  }
  ans += perform(i+1, g, b); ans %= mod;
  ans += perform(r, i+1, b); ans %= mod;
  ans += perform(r, g, i+1); ans %= mod;
  return ans;
}

int main(){
  cin >> n;
  memset(dp, -1, sizeof(dp));
  int m;cin >> m;
  for(int i=0;i<m;i++){
    int l,r,x; cin >> l >> r >> x;
    qe[r].push_back(pii(l,x));
  }
  cout << perform(0, 0, 0) << "\n";
}
