#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)

#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif

#include <limits.h>
#include <math.h>
#include <time.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << '\n'
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
#define int long long
//#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << ((i == v.size() - 1) ? "\n" : " ")
template <typename T1, typename T2> inline void chmin(T1& a, T2 b) {if (a > b) a = b;}
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) {if (a < b) a = b;}
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9 + 7;
constexpr int MAX = 500050;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e18 + 1;
constexpr int INF = 1e9 + 1;
// const int dx[4] = { 0,0,-1,1 }, dy[4] = { 1,-1,0,0 };

const int mod = 1000000007;
//const int mod = 998244353;
struct mint {
	ll x; // typedef long long ll;
	mint(ll x = 0) :x((x%mod + mod) % mod) {}
	mint operator-() const { return mint(-x); }
	mint& operator+=(const mint a) {
		if ((x += a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint a) {
		if ((x += mod - a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this; }
	mint operator+(const mint a) const { return mint(*this) += a; }
	mint operator-(const mint a) const { return mint(*this) -= a; }
	mint operator*(const mint a) const { return mint(*this) *= a; }
	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime mod
	mint inv() const { return pow(mod - 2); }
	mint& operator/=(const mint a) { return *this *= a.inv(); }
	mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }


mint dp[303][303][303];
void solve() {
	int N, M; cin >> N >> M;
	using arr3 = array<int, 3>;
	vector<arr3>v(M);
	REP(i, M) {
		int l, r, x; cin >> l >> r >> x;
		v[i] = { l,r,x };
	}
	sort(all(v), [](const arr3 &a,const arr3 &b) {
		if (a[1] != b[1])return a[1] < b[1];
		else if (a[0] != b[0])return a[0] < b[0];
		else return a[2] < b[2];
	});
	int idx = 0;
	dp[0][0][0] = 1;
	REP(k, N + 1) {
		while (idx < M&&k == v[idx][1]) {
			int l = v[idx][0], r = v[idx][1], x = v[idx][2];
			idx++;
			if (x == 1) {
				REP(i, k+1)REP(j, k+1) {
					if (i >= l || j >= l) {
						dp[k][i][j] = dp[i][k][j] = dp[i][j][k] = 0;
					}
				}
			}
			else if (x == 3) {
				REP(i, k+1)REP(j, k+1) {
					if (i < l || j < l) {
						dp[k][i][j] = dp[i][k][j] = dp[i][j][k] = 0;
					}
				}
			}
			else {
				REP(i, k+1)REP(j, k+1) {
					if ((i < l && j < l) || (i >= l && j >= l)) {
						dp[k][i][j] = dp[i][k][j] = dp[i][j][k] = 0;
					}
				}
			}
		}
		if (k == 0) {
			dp[1][0][0] += 1;
			dp[0][1][0] += 1;
			dp[0][0][1] += 1;
		}
		else if (k == 1) {
			dp[2][0][0] += dp[1][0][0];
			dp[2][1][0] += dp[0][1][0];
			dp[2][0][1] += dp[0][0][1];
			dp[0][2][0] += dp[0][1][0];
			dp[1][2][0] += dp[1][0][0];
			dp[0][2][1] += dp[0][0][1];
			dp[0][0][2] += dp[0][0][1];
			dp[1][0][2] += dp[1][0][0];
			dp[0][1][2] += dp[0][1][0];
		}
		else {
			REP(i, k)REP(j, k) {
				dp[k + 1][i][j] += dp[k][i][j];
				dp[k][k + 1][j] += dp[k][i][j];
				dp[k][i][k + 1] += dp[k][i][j];

				dp[k + 1][k][j] += dp[i][k][j];
				dp[i][k + 1][j] += dp[i][k][j];
				dp[i][k][k + 1] += dp[i][k][j];

				dp[k + 1][j][k] += dp[i][j][k];
				dp[i][k + 1][k] += dp[i][j][k];
				dp[i][j][k + 1] += dp[i][j][k];
			}
		}

	}
	mint ans = 0;
	REP(i, N)REP(j, N) {
		ans += dp[i][j][N];
		ans += dp[i][N][j];
		ans += dp[N][i][j];
	}
	print(ans);
}

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

	 //int q;
	 //cin >> q;
	 //while (q--)
	solve();
}


Measured memory_bytes: 220952