#include <iostream>
#include <vector>
#include <map>
#include <cstring>
#include <numeric>
#include <algorithm>
using namespace std;

// modint: mod 計算を int を扱うように扱える構造体
template<int MOD> struct Fp {
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) v += MOD;
    }
    constexpr int getmod() { return MOD; }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator == (const Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr istream& operator >> (istream &is, Fp<MOD>& x) noexcept {
        return is >> x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1) t = t * a;
        return t;
    }
};

// 二項係数ライブラリ
template<class T> struct BiCoef {
    vector<T> fact_, inv_, finv_;
    constexpr BiCoef() {}
    constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
        init(n);
    }
    constexpr void init(int n) noexcept {
        fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
        int MOD = fact_[0].getmod();
        for(int i = 2; i < n; i++){
            fact_[i] = fact_[i-1] * i;
            inv_[i] = -inv_[MOD%i] * (MOD/i);
            finv_[i] = finv_[i-1] * inv_[i];
        }
    }
    constexpr T com(int n, int k) const noexcept {
        if (n < k || n < 0 || k < 0) return 0;
        return fact_[n] * finv_[k] * finv_[n-k];
    }
    constexpr T fact(int n) const noexcept {
        if (n < 0) return 0;
        return fact_[n];
    }
    constexpr T inv(int n) const noexcept {
        if (n < 0) return 0;
        return inv_[n];
    }
    constexpr T finv(int n) const noexcept {
        if (n < 0) return 0;
        return finv_[n];
    }
};

const int MOD = 1000000007;
using mint = Fp<MOD>;
BiCoef<mint> bc;

int N, M;
using pint = pair<int,int>;
map<int, vector<pint>> inters;

const int MAX = 310;
mint dp[MAX][MAX][MAX];

bool check(int i, int j, int k, int l, int x) {
    vector<int> rs = {i, j, k};
    sort(rs.begin(), rs.end());
    int num = 1;
    if (l < rs[0]) ++num;
    if (l < rs[1]) ++num;
    return num == x;
}

mint solve() {
    memset(dp, 0, sizeof(dp));
    dp[0][0][0] = 1;
    for (int i = 0; i <= N; ++i) { // R 
        for (int j = i; j <= N; ++j) { // G
            for (int k = j; k <= N; ++k) { // B
                int r = max({i, j, k});
                // i -> r+1
                {
                    bool ok = true;
                    for (auto p : inters[r+1]) {
                        if (!check(r+1, j, k, p.first, p.second)) {
                            ok = false;
                            break;
                        }
                    }
                    if (ok) dp[j][k][r+1] += dp[i][j][k];
                }
                // j -> r+1
                {
                    bool ok = true;
                    for (auto p : inters[r+1]) {
                        if (!check(i, r+1, k, p.first, p.second)) {
                            ok = false;
                            break;
                        }
                    }
                    if (ok) dp[i][k][r+1] += dp[i][j][k];
                }
                // k -> r+1
                {
                    bool ok = true;
                    for (auto p : inters[r+1]) {
                        if (!check(i, j, r+1, p.first, p.second)) {
                            ok = false;
                            break;
                        }
                    }
                    if (ok) dp[i][j][r+1] += dp[i][j][k];
                }
            }
        }
    }
    mint res = 0;
    for (int i = 0; i <= N; ++i)
        for (int j = 0; j <= N; ++j)
            for (int k = 0; k <= N; ++k)
                if (i == N || j == N || k == N)
                    res += dp[i][j][k];
    return res;
}

int main() {
    while (cin >> N >> M) {
        inters.clear();
        for (int i = 0; i < M; ++i) {
            int l, r, x; cin >> l >> r >> x; --l;
            inters[r].push_back({l, x});
        }
        for (auto &it : inters) sort(it.second.begin(), it.second.end());
        cout << solve() << endl;
    }
}


Measured memory_bytes: 233088