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

#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int64 i = 0;i < (n);i++)
#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second

using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;

const double eps = 1e-10;

template<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}
template<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}

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...));
}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value!=0>::type
fill_v(U &u,const V... v){u=U(v...);}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value==0>::type
fill_v(U &u,const V... v) {
    for (auto &e:u) fill_v<T>(e, v...);
}

template<::std::uint_fast64_t mod>
class ModInt{
private:
    using value_type = ::std::uint_fast64_t;
    value_type n;
public:
    ModInt() : n(0) {}
    ModInt(value_type n_) : n(n_ % mod) {}
    ModInt(const ModInt& m) : n(m.n) {}

    template<typename T>
    explicit operator T() const { return static_cast<T>(n); }
    value_type get() const { return n; }

    friend ::std::ostream& operator<<(::std::ostream &os, const ModInt<mod> &a) {
        return os << a.n;
    }

    friend ::std::istream& operator>>(::std::istream &is, ModInt<mod> &a) {
        value_type x;
        is >> x;
        a = ModInt<mod>(x);
        return is;
    }

    bool operator==(const ModInt& m) const { return n == m.n; }
    bool operator!=(const ModInt& m) const { return n != m.n; }
    ModInt& operator*=(const ModInt& m){ n = n * m.n % mod; return *this; }

    ModInt pow(value_type b) const{
        ModInt ans = 1, m = ModInt(*this);
        while(b){
            if(b & 1) ans *= m;
            m *= m;
            b >>= 1;
        }
        return ans;
    }

    ModInt inv() const { return (*this).pow(mod-2); }
    ModInt& operator+=(const ModInt& m){ n += m.n; n = (n < mod ? n : n - mod); return *this; }
    ModInt& operator-=(const ModInt& m){ n += mod - m.n; n = (n < mod ? n : n - mod); return *this; }
    ModInt& operator/=(const ModInt& m){ *this *= m.inv(); return *this; }
    ModInt operator+(const ModInt& m) const { return ModInt(*this) += m; }
    ModInt operator-(const ModInt& m) const { return ModInt(*this) -= m; }
    ModInt operator*(const ModInt& m) const { return ModInt(*this) *= m; }
    ModInt operator/(const ModInt& m) const { return ModInt(*this) /= m; }
    ModInt& operator++(){ n += 1; return *this; }
    ModInt& operator--(){ n -= 1; return *this; }
    ModInt operator++(int){
        ModInt old(n);
        n += 1;
        return old;
    }
    ModInt operator--(int){
        ModInt old(n);
        n -= 1;
        return old;
    }
    ModInt operator-() const { return ModInt(mod-n); }
};

constexpr int64 mod = 1e9+7;
using Mint = ModInt<mod>;

int64 N, M;

struct T {
    int64 l, r, num;
    T() {}
    T(int64 l_, int64 r_, int64 num_) : l(l_), r(r_), num(num_) {}
};
vector<T> cond;

int main(void) {
    cin >> N >> M;
    cond.resize(M);
    REP(i, M) {
        int64 l, r, x;
        cin >> l >> r >> x; l+=2; r+=2;
        cond[i] = T(l, r, x);
    }
    sort(all(cond), [](const T& lhs, const T& rhs) {
        return lhs.r < rhs.r;
    });
    auto dp = make_v<Mint>(310,310);
    dp[0][1] = 1;
    int64 cond_id = 0;
    FOR(i, 2, N+2) {
        auto dp2 = make_v<Mint>(N+3, N+3);
        vector<T> need;
        while (cond_id < M && cond[cond_id].r == i+1) {
            need.push_back(cond[cond_id]);
            cond_id++;
        }
        REP(p1, i+1) {
            FOR(p2, p1+1, i+1) {
                REP(c3, 3) {
                    vector<int> place(3);
                    place[0] = p1; place[1] = p2; place[2] = i;
                    place[c3] = i+1;
                    sort(all(place));
                    bool ok = 1;
                    for (auto &cond_ : need) {
                        int64 l, r, num;
                        int64 cnt = 0;
                        REP(j, 3) {
                            if (cond_.l <= place[j] && place[j] <= cond_.r) cnt++;
                        }
                        if (cond_.num != cnt) {
                            ok = 0;
                            break;
                        }
                    }
                    if (ok) {
                        dp2[place[0]][place[1]] += dp[p1][p2];
//                            } else {
//                                cout << "(" << c1 << " " << p1 << " " << c2 << " " << p2 << " :" << dp[c1][p1][c2][p2]
//                                     << ") out" << endl;
                    }
                }
            }
        }
        swap(dp, dp2);
    }
    Mint res = 0;
    REP(i, dp.size()) {
        REP(j, dp[i].size()) {
            res += dp[i][j];
        }
    }
    cout << res << endl;
}


Measured memory_bytes: 1792