def aa(q,w):
    if q<w or w<0:
        return 0
    global mod
    return f[q]*g[w]%mod*g[q-w]%mod

n,m=map(int,input().split())
f=[1]*10**6;g=[1]*len(f);mod=10**9+7
for i in range(1,len(f)):
    f[i]=f[i-1]*i%mod
g[-1]=pow(f[-1],mod-2,mod)
for i in range(len(f)-1,0,-1):
    g[i-1]=g[i]*i%mod
ans=aa(n*2,n)*(n*2%mod)%mod
for i in range(m):
    a,b,c=map(int,input().split())
    x,y=b,c
    if a==1:
        x+=1
    else:
        y+=1
    ans-=aa(b+c,b)*aa(n-x+n-y,n-x)%mod;ans%=mod
print(ans)