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

#ifdef SG
	#include <debug.h>
#else
	template<typename T> struct outputer;
	struct outputable {};
	#define PRINT(...)
	#define OUTPUT(...)
	#define show(...)
	#define debug(...)
	#define deepen(...)
	#define timer(...)
	#define fbegin(...)
	#define fend
	#define pbegin(...)
	#define pend
#endif

#define ARG4(_1,_2,_3,_4,...) _4

#define forn3(i,l,r) for (int i = int(l); i < int(r); ++i)
#define forn2(i,n) forn3 (i, 0, n)
#define forn(...) ARG4(__VA_ARGS__, forn3, forn2) (__VA_ARGS__)

#define ford3(i,l,r) for (int i = int(r) - 1; i >= int(l); --i)
#define ford2(i,n) ford3 (i, 0, n)
#define ford(...) ARG4(__VA_ARGS__, ford3, ford2) (__VA_ARGS__)

#define ve vector
#define pa pair
#define tu tuple
#define mp make_pair
#define mt make_tuple
#define pb emplace_back
#define fs first
#define sc second
#define all(a) (a).begin(), (a).end()
#define sz(a) ((int)(a).size())

typedef long double ld;
typedef int64_t ll;
typedef uint64_t ull;
typedef uint32_t ui;
typedef uint16_t us;
typedef uint8_t uc;
typedef pa<int, int> pii;
typedef pa<int, ll> pil;
typedef pa<ll, int> pli;
typedef pa<ll, ll> pll;
typedef ve<int> vi;

template<typename T> inline auto sqr (T x) -> decltype(x * x) {return x * x;}
template<typename T1, typename T2> inline bool umx (T1& a, T2 b) {if (a < b) {a = b; return 1;} return 0;}
template<typename T1, typename T2> inline bool umn (T1& a, T2 b) {if (b < a) {a = b; return 1;} return 0;}

const int N = 300;
const int M = 300;

const ll mod = 1000000007;

struct Input {
	int n, m;
	int l[M], r[M], k[M];
	
	bool read () {
		if (!(cin >> n >> m)) {
			return 0;
		}
		forn (i, m) {
			scanf("%d%d%d", &l[i], &r[i], &k[i]);
			--l[i];
		}
		return 1;
	}

	void init (const Input &input) {
		*this = input;
	}
};

struct Data: Input {
	ll ans;
	
	void write () {
		cout << ans << endl;
	}
};


namespace Main {
	
	struct Solution: Data {
		ll d[2][3][N + 1][N + 1];
		vi v[N + 1];
		
		void solve () {
			forn (i, m) {
				v[r[i]].pb(i);
			}
			
			memset(d, 0, sizeof d);
			d[0][0][0][0] = 1;
			forn (i, n + 1) {
				int i0 = i & 1;
				int i1 = i0 ^ 1;
				
				forn (t, 3) {
					forn (x, i + 1) {
						forn (y, i + 1) {
							for (int j : v[i]) {
								if (k[j] != 1 + (x > l[j]) + (y > l[j])) {
									d[i0][t][x][y] = 0;
								}
							}
							debug(mt(i, t, x, y, d[i0][t][x][y]));
						}
					}
				}
				
				if (i == n) {
					break;
				}
				
				memset(d[i1], 0, sizeof d[i1]);
				forn (t, 3) {
					forn (x, i + 1) {
						forn (y, i + 1) {
							(d[i1][t][x][y] += d[i0][t][x][y]) %= mod;
							(d[i1][(t + 1) % 3][y][i] += d[i0][t][x][y]) %= mod;
							(d[i1][(t + 2) % 3][i][x] += d[i0][t][x][y]) %= mod;
						}
					}
				}
			}
			
			ans = 0;
			forn (t, 3) {
				forn (x, n + 1) {
					forn (y, n + 1) {
						(ans += d[n & 1][t][x][y]) %= mod;
					}
				}
			}
		}
		
		void clear () {
			*this = Solution();
		}
	};
}


Main::Solution sol;

int main () {
	cout.setf(ios::showpoint | ios::fixed);
	cout.precision(20);

	#ifdef SG
		freopen((problemname + ".in").c_str(), "r", stdin);
//		freopen((problemname + ".out").c_str(), "w", stdout);
		while (sol.read()) {
			sol.solve();
			sol.write();
			sol.clear();
		}
	#else
		sol.read();
		sol.solve();
		sol.write();
	#endif
	
	/*
	int t;
	cin >> t;
	forn (i, t) {
		sol.read();
		sol.solve();
		sol.write();
		sol.clear();
	}
	*/
	
	return 0;
}


Measured memory_bytes: 4480