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

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
//typedef vector<vector<ll>> Graph;

const ll mod = 1e9 + 7;
//const ll mod = 998244353;

#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define spa << " " <<
#define fi first
#define se second

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }

template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){
os << "(" << v.first << ", " << v.second << ")"; return os;
}
template<class T> ostream& operator << (ostream& os, const vector<T> v){
for(int i = 0; i < (int)v.size(); i++){if(i > 0){os << " ";} os << v[i];} return os;
}
template<class T> ostream& operator << (ostream& os, const vector<vector<T>> v){
for(int i = 0; i < (int)v.size(); i++){if(i > 0){os << endl;} os << v[i];} return os;
}

template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<endl;}};
template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];
for(ll i=1;i<n;i++)cerr spa v[i];
cerr<<endl;};

template <std::uint_fast64_t Modulus> class modint {
  // long long から modint を作るときは必ず正の数にしてからコンストラクタに入れること！ 
  // そうしないとバグります
  using u64 = std::uint_fast64_t;

public:
  u64 a;

  constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
  constexpr u64 &value() noexcept { return a; }
  constexpr const u64 &value() const noexcept { return a; }
  constexpr modint operator+(const modint rhs) const noexcept {
    return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
    return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
    return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
    return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
    a += rhs.a;
    if (a >= Modulus) {
      a -= Modulus;
    }
    return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
    if (a < rhs.a) {
      a += Modulus;
    }
    a -= rhs.a;
    return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
    a = a * rhs.a % Modulus;
    return *this;
  }
  constexpr modint &operator/=(modint rhs) noexcept {
    u64 exp = Modulus - 2;
    while (exp) {
      if (exp % 2) {
        *this *= rhs;
      }
      rhs *= rhs;
      exp /= 2;
    }
    return *this;
  }
};
using mint = modint<mod>;

template <class T, class U> constexpr T power(T x, U exp) {
  T ret = static_cast<T>(1);
  while (exp) {
    if (exp % static_cast<U>(2) == static_cast<U>(1))
      ret *= x;
    exp /= static_cast<U>(2);
    x *= x;
  }
  return ::std::move(ret);
}

using vm = vector<mint>;
using vvm = vector<vm>;
using vvvm = vector<vvm>;

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

    ll N, M;
    cin >> N >> M;

    vvvm dp(N+1, vvm(N+1, vm(N+1, 0)));
    vector<ll> l(M), r(M), x(M);
    REP(i, M) cin >> l[i] >> r[i] >> x[i];
    REP(i, M) l[i]--, r[i]--;
    vvl G(N);
    REP(i, M) G[r[i]].push_back(i);

    REP(i, N){
        REP(j, N){
            REP(k, N){
                if(j==0 and k==0){
                    if(i==0) dp[i+1][1][0] += 3;
                }
                if(j!=0 and k==0){
                    dp[i+1][1][i+1] += dp[i][j][k] * 2;
                    dp[i+1][j+1][0] += dp[i][j][k];
                }
                if(j!=0 and k!=0){
                    dp[i+1][1][j+1] += dp[i][j][k];
                    dp[i+1][1][k+1] += dp[i][j][k];
                    dp[i+1][j+1][k+1] += dp[i][j][k];
                }
            }
        }

        REP(j, N+1){
            REP(k,  N+1){
                for(auto idx: G[i]){
                    ll len = r[idx] - l[idx] + 1;
                    if(x[idx]==1){
                        if(j<len) dp[i+1][j][k] = 0;
                    }
                    if(x[idx]==2){
                        if(j>=len or k<len) dp[i+1][j][k] = 0;
                    }
                    if(x[idx]==3){
                        if(j>=len or k>=len) dp[i+1][j][k] = 0;
                    }
                }
            }
        }

        // dump(i+1)
        // REP(j, N+1){
        //     REP(k, N+1){
        //         cout << dp[i+1][j][k].value() << " ";
        //     }
        //     cout << endl;
        // }
    }

    mint res = 0;
    REP(i, N+1){
        REP(j, N+1){
            res += dp[N][i][j];
        }
    }    
    cout << res.value() << endl;
    return 0;
}

Measured memory_bytes: 219944