// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 305;
const int MOD = 1e9 + 7;

struct Atom {
    int l, r, x;
};

int N, M;
Atom A[MAXN];

void input()
{
    read(N); read(M);
    for (int i = 1; i <= M; ++i) {
        read(A[i].l); read(A[i].r); read(A[i].x);
    }
}

vector<Pii> list;

inline bool check(int a, int b, int c)
{
    // printf("%d %d %d\n", a, b, c);
    // assert(a > b && (b > c || (!b && !c)));
    for (auto &t : list) {
        if (t.y == 1) {
            if (b >= t.x)
                return false;
        } else if (t.y == 2) {
            if (b < t.x || c >= t.x)
                return false;
        } else if (t.y == 3) {
            if (c < t.x)
                return false;
        }
    }
    return true;
}

void solve()
{
    static int dp[MAXN][MAXN][MAXN];

    dp[0][0][0] = 1;
    for (int i = 1; i <= N; ++i) {
        list.clear();
        for (int j = 1; j <= M; ++j) {
            if (A[j].r == i)
                list.push_back(MP(A[j].l, A[j].x));
        }
        for (int j = 0; j < i; ++j) {
            for (int k = 0; k < j || (!j && !k); ++k) {
                if (!dp[i - 1][j][k]) continue;
                if (check(i, j, k))
                    (dp[i][j][k] += dp[i - 1][j][k]) %= MOD;
                if (i - 1 != j) {
                    if (check(i, i - 1, j))
                        (dp[i][i - 1][j] += dp[i - 1][j][k]) %= MOD;
                    if (j != k && check(i, i - 1, k))
                        (dp[i][i - 1][k] += dp[i - 1][j][k]) %= MOD;
                }
            }
        }
    }

    LL ans = 3ll * dp[N][0][0] % MOD;
    for (int j = 0; j < N; ++j) {
        for (int k = 0; k < j; ++k) {
            // printf("dp(%d,%d)=%d\n", j, k, dp[N][j][k]);
            (ans += dp[N][j][k] * 6ll) %= MOD;
        }
    }

    printf("%lld\n", ans);
}

int main()
{
#ifdef __DEBUG
    freopen("E.in", "r", stdin);
    freopen("E.out", "w", stdout);
#endif

    input();
    solve();

    return 0;
}

// 天与短因缘，聚散常容易。
//     -- 晏几道《生查子·狂花顷刻香》


Measured memory_bytes: 108800