#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <ctime>
#include <complex>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 1020000;
ll dy[8] = {1,-1,0,0,1,-1,1,-1};
ll dx[8] = {0,0,1,-1,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    rep(i,a.size()) cout << a[i] << " ";
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
ll pcount(ll x) {return __builtin_popcountll(x);}
const int mod = 1e9 + 7;
//const int mod = 998244353;

template <std::uint_fast64_t Modulus> class modint {
  using u64 = std::uint_fast64_t;

public:
  u64 a;

  constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
  constexpr u64 &value() noexcept { return a; }
  constexpr const u64 &value() const noexcept { return a; }
  constexpr modint operator+(const modint rhs) const noexcept {
	return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
	return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
	return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
	return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
	a += rhs.a;
	if (a >= Modulus) {
	  a -= Modulus;
	}
	return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
	if (a < rhs.a) {
	  a += Modulus;
	}
	a -= rhs.a;
	return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
	a = a * rhs.a % Modulus;
	return *this;
  }
  constexpr modint &operator/=(modint rhs) noexcept {
	u64 exp = Modulus - 2;
	while (exp) {
	  if (exp % 2) {
		*this *= rhs;
	  }
	  rhs *= rhs;
	  exp /= 2;
	}
	return *this;
  }
};

using mint = modint<mod>;

mint dp[303][303][303];
vector<vpl> ls(303);

int main(){
	int n,m; cin >> n >> m;
	bool exist = true;
	rep(i,m){
		int l,r,x; cin >> l >> r >> x;
		if(l == r){
			if(x != 1) exist = false;
			continue;
		}
		ls[r].emplace_back(l,x);
	}
	if(!exist){
		cout << 0 << "\n";
		return 0;
	}
	rep(i,n+1) sort(all(ls[i]));
	dp[0][0][0] = 1;
	rep(i,n){
		rep(j,i+1){
			rep(k,j+1){
				bool f = true;
				int g = -1;
				int h = -1;
				for(auto l : ls[i+1]){
					if(l.first <= k){
						if(l.second != 3) f = false;
					}
					else if(l.first <= j){
						if(l.second == 1) g = 2;
						if(g == -1) g = l.second - 2;
						else{
							if(l.second - 2 != g) g = 2;
						}
					}
					else if(l.first <= i){
						if(h == -1) h = l.second - 1;
						else{
							if(l.second - 1 != h) h = 2;
						}
					}
				}
				if(!f || g == 2 || h == 2) continue;
				if(g == 1){
					if(h == 1 || h == -1){
						dp[i+1][i][j] += dp[i][j][k];
					}
				}else if(g == 0){
					if(h == 1 || h == -1){
						dp[i+1][i][k] += dp[i][j][k];
					}
					if(h == 0 || h == -1){
						dp[i+1][j][k] += dp[i][j][k];
					}
				}else if(g == -1){
					if(h == 1 || h == -1){
						dp[i+1][i][j] += dp[i][j][k];
						dp[i+1][i][k] += dp[i][j][k];
					}
					if(h == 0 || h == -1){
						dp[i+1][j][k] += dp[i][j][k];
					}
				}
			}
		}
	}
	mint ans = 0;
	rep(j,n) rep(k,n) ans += dp[n][j][k];
	cout << ans.value() << "\n";
}

Measured memory_bytes: 111328