#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long fac[400040], finv[400040], inv[400040];
long long mod = 1000000007;
void COMinit() {
	fac[0] = fac[1] = 1;
	finv[0] = finv[1] = 1;
	inv[1] = 1;
	for (int i = 2; i < 400040; i++) {
		fac[i] = fac[i - 1] * i % mod;
		inv[i] = mod - inv[mod % i] * (mod / i) % mod;
		finv[i] = finv[i - 1] * inv[i] % mod;
	}
}
long long COM(long long n, long long k) {
	if (n < k) return 0;
	if (n < 0 || k < 0) return 0;
	return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
int main() {
	COMinit();
	long long n, m;
	cin >> n >> m;
	long long ans = COM(n + n, n) * 2 * n % mod;
	for (int i = 0; i < m; i++) {
		int t, x, y;
		cin >> t >> x >> y;
		if (t == 1) {
			ans -= COM(x + y, y) * COM((n - x - 1) + (n - y), n - x - 1) % mod;
		}
		else {
			ans -= COM(x + y, y) * COM((n - x) + (n - y - 1), n - x) % mod;
		}
		ans %= mod;
	}
	cout << (ans + mod) % mod << endl;
}