/*
--------------              |   /
      |                     |  /
      |                     | /
      |             *       |/          |    |         ------            *
      |                     |           |    |        /      \
      |             |       |\          |    |       |       |\          |
   \  |             |       | \         |    |       |       | \         |
    \ |             |       |  \        |    |        \     /   \        |
     V              |       |   \        \__/|         -----     \       |
*/
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << "\e[1;31m" << #x << " = " << (x) << "\e[0m\n"
#define print(x) emilia_mata_tenshi(#x, begin(x), end(x))
template<typename T> void emilia_mata_tenshi(const char *s, T l, T r) {
	cerr << "\e[1;33m" << s << " = [";
	while(l != r) {
		cerr << *l;
		cerr << (++l == r ? ']' : ',');
	}
	cerr << "\e[0m\n";
}

#define EmiliaMyWife ios::sync_with_stdio(0); cin.tie(NULL);
using ll = int64_t;
using ull = uint64_t;
using ld = long double;
using uint = uint32_t;
const double EPS  = 1e-8;
const int INF     = 0x3F3F3F3F;
const ll LINF     = 4611686018427387903;
const int MOD     = 1e9+7;
/*--------------------------------------------------------------------------------------*/

signed main() { EmiliaMyWife
	int n, m;
	cin >> n >> m;
	vector<ll> fac(n * 2 + 3, 1);
	for(int i = 1; i <= n * 2 + 2; i++)
		fac[i] = fac[i - 1] * i % MOD;
	auto mpow = [&](ll a, int b) {
		ll res = 1;
		for(; b; b >>= 1, a = a * a % MOD)
			if(b & 1)
				res = res * a % MOD;
		return res;
	};
	auto cnm = [&](int n, int m) {
		if(n < m)
			return ll(0);
		return fac[n] * mpow(fac[m], MOD - 2) % MOD * mpow(fac[n - m], MOD - 2) % MOD;
	};
	auto cal = [&](int a, int b) { return cnm(a + b, a); };
	ll ans = cal(n, n) * n * 2 % MOD;
	//debug(ans);
	while(m--) {
		int t, x, y;
		cin >> t >> x >> y;
		int dx = x, dy = y;
		if(t == 1)
			dx++;
		else
			dy++;
		ans = (ans - cal(x, y) * cal(n - dx, n - dy) % MOD + MOD) % MOD;
	}
	
	cout << ans << '\n';
}