#include <bits/stdc++.h>
using namespace std;
using LL = long long;

template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}


// std::vector Declaration
template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
   return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

// std::vector Initialization
template<typename T>
void fill_all(T& arr, const T& v) { arr = v; }
template<typename T, typename U>
void fill_all(T& arr, const U& v) { for (auto& i : arr) fill_all(i, v); }

// std::vector Debug
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
   os << "[";
   bool a = 1;
   for (auto e : v ) {
      os << (a ? "" : " "); 
      os << e;
      a = 0;
   }
   os << "]";
   return os;
}

// std::pair Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
   os << "(" << p.first << " " << p.second << ")";
   return os;
}

// std::set Debug
template<typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
   os << "{";
   bool a = 1;
   for (auto e : st) {
      os << (a ? "" : " ");
      os << e;
      a = 0;
   }
   os << "}";
   return os;
}

// std::map Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& mp) {
   os << "{";
   bool a = 1;
   for (auto e : mp) {
      os << (a ? "" : " ");
      os << e.first << ":" << e.second;
      a = 0;
   }
   os << "}";
   return os;
}

// std::tuple Debug
template<int N,class Tuple>
void out(ostream &os,const Tuple &t){}
template<int N,class Tuple,class H,class ...Ts>
void out(ostream &os,const Tuple &t){
   if(N)os<<" ";
   os<<get<N>(t);
   out<N+1,Tuple,Ts...>(os,t);
}
template<class ...Ts>
ostream& operator<<(ostream &os, const tuple<Ts...> &t){
   os<<"(";
   out<0,tuple<Ts...>,Ts...>(os,t);
   os<<")";
   return os;
}

// Debug
#define DUMP(x) cout<<#x<<" = "<<(x)<<endl

struct edge { int to, cost; };

const LL LINF = 1LL<<60;
const int IINF = 1<<30;
const LL MOD = 1e9+7;



int main()
{
   int N, M; cin >> N >> M;
   vector<int> l(M), r(M), x(M);
   for (int i = 0; i < M; ++i) {
      cin >> l[i] >> r[i] >> x[i];
   }


   vector<vector<pair<int,int>>> condition(N+1);
   for (int i = 0; i < M; ++i) {
      condition[r[i]].push_back({l[i], x[i]});
   }

   auto dp = make_v<LL>(N+1, N+1, N+1);
   dp[0][0][0] = 1;

   for (int a = 0; a < N; ++a) {
      for (int b = 0; b < N; ++b) {
         for (int c = 0; c < N; ++c) {
            int k = max({a,b,c});

            {
               bool flag = false;
               for (auto p : condition[k+1]) {
                  if (p.second != 1 + (p.first <= b) + (p.first <= c)) {
                     flag = true;
                  }
               }
               if (flag) {
                  dp[k+1][b][c] = 0;
               } else {
                  (dp[k+1][b][c] += dp[a][b][c]) %= MOD;
               }
            }
            {
               bool flag = false;
               for (auto p : condition[k+1]) {
                  if (p.second != 1 + (p.first <= c) + (p.first <= a)) {
                     flag = true;
                  }
               }
               if (flag) {
                  dp[a][k+1][c] = 0;
               } else {
                  (dp[a][k+1][c] += dp[a][b][c]) %= MOD;
               }
            }
            {
               bool flag = false;
               for (auto p : condition[k+1]) {
                  if (p.second != 1 + (p.first <= a) + (p.first <= b)) {
                     flag = true;
                  }
               }
               if (flag) {
                  dp[a][b][k+1] = 0;
               } else {
                  (dp[a][b][k+1] += dp[a][b][c]) %= MOD;
               }
            }

         }
      }
   }

   LL sum = 0;
   for (int a = 0; a <= N; ++a) {
      for (int b = 0; b <= N; ++b) {
         for (int c = 0; c <= N; ++c) {
            if (max({a,b,c}) == N) {
               (sum += dp[a][b][c]) %= MOD;
            }
         }
      }
   }

   cout << sum << endl;

   return 0;
}


Measured memory_bytes: 218880