#include <bits/stdc++.h>
#define err(args...) {}
#ifdef DEBUG
#include "_debug.cpp"
#endif
using namespace std;
using ll = long long;
using ld = long double;
template <typename T> using lim = numeric_limits<T>;
template <typename T> istream& operator>>(istream& is, vector<T>& a) { for(T& x : a) { is >> x; } return is; }
template <typename X, typename Y> istream& operator>>(istream& is, pair<X, Y>& p) { return is >> p.first >> p.second; }
#ifndef __FASTPOW_INCLUDED_
#define __FASTPOW_INCLUDED_
template <typename T> constexpr T fpow_eq(T& x, long long y, T identity = 1) {
    for(; y > 0; x *= x, y >>= 1) if(y & 1) identity *= x;
    return x = identity;
}
template <typename T> constexpr T fpow(T x, long long y, T identity = 1) { return fpow_eq(x, y, identity); }
#endif
#ifndef __FASTPOW_INCLUDED_
#include "Math - Fast Pow.cpp"
#endif
#ifdef __TOTIENT_INCLUDED_
template <int M, int PHI_M = phi(M)> struct modint {
#else
template <int M, int PHI_M> struct modint {
#endif
    static constexpr int MOD = M;
    int val;
    constexpr modint() : val(0) {}
    constexpr modint(int x) : val(x % M) { val += val < 0 ? M : 0; }
    constexpr modint(long long x) : modint(int(x % M)) {}
    constexpr explicit operator int() const { return val; }
    constexpr bool operator==(const modint& y) const { return val == y.val; }
    constexpr bool operator!=(const modint& y) const { return val != y.val; }
    constexpr modint& operator=(const modint& y) { val = y.val; return *this; }
    constexpr modint& operator+=(const modint& y) { val += y.val; val -= val >= M ? M : 0; return *this; }
    constexpr modint& operator-=(const modint& y) { val -= y.val; val += val <  0 ? M : 0; return *this; }
    constexpr modint& operator*=(const modint& y) { val = ll(val) * y.val % M; return *this; }
    constexpr modint& operator/=(const modint& y) { val = ll(val) * fpow(y, PHI_M - 1).val % M; return *this; }
    constexpr modint& operator^=(ll y) { fpow_eq(*this, y); return *this; }
    constexpr modint operator+(const modint& y) const { return modint(*this) += y; }
    constexpr modint operator-(const modint& y) const { return modint(*this) -= y; }
    constexpr modint operator*(const modint& y) const { return modint(*this) *= y; }
    constexpr modint operator/(const modint& y) const { return modint(*this) /= y; }
    constexpr modint operator^(ll y) const { return modint(*this) ^= y; }
    constexpr modint operator-() const { return modint(0) -= *this; }
    constexpr modint operator~() const { return modint(1) /= *this; }
    constexpr modint& operator++() { val = val == M - 1 ? 0 : val + 1; return *this; }
    constexpr modint& operator--() { val = val == 0 ? M - 1 : val - 1; return *this; }
    constexpr modint operator++(int) { modint m = *this; ++(*this); return m; }
    constexpr modint operator--(int) { modint m = *this; --(*this); return m; }
    friend constexpr modint operator+(long long x, const modint& y) { return modint(x) + y; }
    friend constexpr modint operator*(long long x, const modint& y) { return modint(x) * y; }
    friend constexpr modint operator-(long long x, const modint& y) { return modint(x) - y; }
    friend constexpr modint operator/(long long x, const modint& y) { return modint(x) / y; }
    friend ostream& operator<<(ostream& os, const modint& m) { return os << m.val; }
    friend istream& operator>>(istream& is, modint& m) { ll val; is >> val; m = modint(val); return is; }
};
constexpr int M = 1'000'000'007;
using mint = modint<M, M - 1>;
mint operator""_m(unsigned long long int x) { return mint(ll(x)); }
const int N = 300;
mint memo[N+1][N+1][N+1];
bool in_memo[N+1][N+1][N+1];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    vector<int> 
    min1(n + 2, lim<int>::max()), 
    min2(n + 2, lim<int>::max()), 
    max2(n + 2, lim<int>::min()),
    max3(n + 2, lim<int>::min());
    for(int i = 0; i < m; i++) {
        int l, r, x;
        cin >> l >> r >> x;
        if(x == 1) {
            min1[r + 1] = min(min1[r + 1], l);
        } else if(x == 2) {
            min2[r + 1] = min(min2[r + 1], l);
            max2[r + 1] = max(max2[r + 1], l);
        } else {
            max3[r + 1] = max(max3[r + 1], l);
        }
    }
    auto count_in_range = [](int l, int latest_r, int latest_g, int latest_b) {
        return (latest_r >= l) + (latest_g >= l) + (latest_b >= l);
    };
    function<mint(int, int, int)> C = [&](int latest_r, int latest_g, int latest_b) {
        mint& ans = memo[latest_r][latest_g][latest_b];
        bool& in = in_memo[latest_r][latest_g][latest_b];
        if(not in) {
            int i = max({latest_r, latest_g, latest_b}) + 1;
            if(count_in_range(min1[i], latest_r, latest_g, latest_b) > 1
            or count_in_range(min2[i], latest_r, latest_g, latest_b) > 2
            or count_in_range(max2[i], latest_r, latest_g, latest_b) < 2
            or count_in_range(max3[i], latest_r, latest_g, latest_b) < 3) {
                ans = 0;
            } else if(i == n + 1) {
                ans = 1;
            } else {
                ans = C(i, latest_g, latest_b) + C(latest_r, i, latest_b) + C(latest_r, latest_g, i);
            }
            in = true;
        }   
        return ans;     
    };
    cout << C(0, 0, 0) << endl;
    return 0;
}


Measured memory_bytes: 133504