MOD = 10**9+7
n, M = map(int, input().split())
N = n*2

fact = [1]*(N+1)
rfact = [1]*(N+1)
for i in range(1, N+1):
  fact[i] = fact[i-1]*i % MOD
rfact[N] = pow(fact[N], MOD-2, MOD)
for i in range(N, 0, -1):
  rfact[i-1] = rfact[i] * i % MOD

# nPk (mod MOD) を求める
def perm(n, k):
  return fact[n] * rfact[n-k] % MOD

# nCk (mod MOD) を求める
def comb(n, k):
  return fact[n] * rfact[k] * rfact[n-k] % MOD

ans = N*comb(N,n)%MOD
for i in range(M):
    t,x,y = map(int, input().split())
    if t==1:
        ans -= comb(x+y,x)*comb(N-x-y-1, n-y)%MOD
    else:
        ans -= comb(x+y,x)*comb(N-x-y-1, n-x)%MOD
    ans %= MOD
print(ans)