#include <stdio.h>

const int Mod = 1000000007;
long long fact[400001], fact_inv[400001];

long long div_mod(long long x, long long y, long long z)
{
	if (x % y == 0) return x / y;
	else return (div_mod((1 + x / y) * y - x, (z % y), y) * z + x) / y;
}

long long combination(int n, int k)
{
	return fact[n] * fact_inv[k] % Mod * fact_inv[n-k] % Mod;
}

int main()
{
	int i, N, M;
	scanf("%d %d", &N, &M);
	for (i = 1, fact[0] = 1; i <= N * 2; i++) fact[i] = fact[i-1] * i % Mod;
	for (i = N * 2 - 1, fact_inv[N*2] = div_mod(1, fact[N*2], Mod); i >= 0; i--) fact_inv[i] = fact_inv[i+1] * (i + 1) % Mod;

	int t, x, y;
	long long ans = combination(N * 2, N) * N * 2 % Mod;
	for (i = 1; i <= M; i++) {
		scanf("%d %d %d", &t, &x, &y);
		if (t == 1) ans -= combination(x + y, x) * combination(N * 2 - x - y - 1, N - y) % Mod;
		else ans -= combination(x + y, x) * combination(N * 2 - x - y - 1, N - x) % Mod;
	}
	printf("%lld\n", (ans % Mod + Mod) % Mod);
	fflush(stdout);
	return 0;
}