n,m = map(int,input().split())
L = [list(map(int,input().split())) for i in range(m)]

mod = 10**9+7

### for bigger prime 
fact = [1,1]
finv = [1,1]
inv = [0,1]
 
for i in range(2,n*2+5):
    fact.append((fact[-1]*i)%mod)
    inv.append((inv[mod%i]*(mod-mod//i))%mod)
    finv.append((finv[-1]*inv[-1])%mod)
 
def nCr(n,r,mod):
    if r > n:
        return 0
    else: 
        return fact[n]*finv[r]%mod*finv[n-r]%mod

ans = nCr(2*n,n,mod)*(2*n)%mod
for t,x,y in L:
    if t == 1:
        ans -= nCr(x+y,x,mod)*nCr(2*n-x-1-y,n-y,mod)
        ans %= mod
    else:
        ans -= nCr(x+y,x,mod)*nCr(2*n-x-1-y,n-x,mod)
        ans %= mod
print(ans)