import sys
input = sys.stdin.readline
N, M = map(int, input().split())
mod = int(1e9) + 7
fact = [1]*(2*N+13)
invf = [1]*(2*N+13)
for i in range(2*N+12):
    fact[i+1] = (i+1)*fact[i] % mod
invf[-1] = pow(fact[-1], mod-2, mod)
for i in range(2*N+12, 0, -1):
    invf[i-1] = i * invf[i] % mod
S = 0
for _ in range(M):
    t, x, y = map(int, input().split())
    X = fact[x+y] * invf[x] % mod
    X = X * invf[y] % mod
    X = X * fact[2*N-x-y-1] % mod
    if t == 1:
        X = X * invf[N-x-1] % mod
        X = X * invf[N-y] % mod
    else:
        X = X * invf[N-x] % mod
        X = X * invf[N-y-1] % mod
    S = (S + X) % mod
print((2*N*fact[2*N] * invf[N] * invf[N] - S) % mod)