n,m = map(int, input().split())
mod = 10**9+7

def cmb(n, r, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n-r] % p

p = 10**9+7
N = 400000  # N は必要分だけ用意する
fact = [1, 1]  # fact[n] = (n! mod p)
factinv = [1, 1]  # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1]  # factinv 計算用

for i in range(2, N + 1):
    fact.append((fact[-1] * i) % p)
    inv.append((-inv[p % i] * (p // i)) % p)
    factinv.append((factinv[-1] * inv[-1]) % p)

ANS = 2*n*fact[2*n]*factinv[n]*factinv[n]%mod

for _ in range(m):
    t,x,y = map(int, input().split())
    TEMP = fact[x+y]*factinv[x]*factinv[y]%mod
    if t==1:
        TEMP = TEMP*fact[2*n-(x+y+1)]*factinv[n-x-1]*factinv[n-y]%mod
    else:
        TEMP = TEMP*fact[2*n-(x+y+1)]*factinv[n-x]*factinv[n-y-1]%mod

    ANS = (ANS-TEMP)%mod
print(ANS)