MOD = 10**9+7
N, M = [int(x) for x in input().split()]
k = 2*N+2

fact = [1] * (k+1); invfact = [1] * (k+1)
for i in range(2, k+1): fact[i] = fact[i-1]*i % MOD
invfact[k] = pow(fact[k], MOD-2, MOD)
for i in range(k, 1, -1): invfact[i-1] = invfact[i]*i % MOD

def ncr(n, r):
    return (((fact[n]*invfact[r])%MOD)*invfact[n-r])%MOD

ans = ncr(2*N,N)*(2*N) % MOD
for _ in range(M):
    t, x, y = [int(x) for x in input().split()]
    tmp = ncr(x+y, x)
    if t==1:
        tmp *= ncr((N-x-1)+(N-y), N-y)
    else:
        tmp *= ncr((N-x)+(N-y-1), N-x)
    ans -= tmp
    ans %= MOD
print(ans)