from sys import stdin
input=lambda :stdin.readline()[:-1]

mod=10**9+7
table_size=10**5*4+10

fac=[1]*table_size
finv=[1]*table_size

for i in range(2,table_size):
  fac[i]=fac[i-1]*i%mod
finv[table_size-1]=pow(fac[table_size-1],mod-2,mod)
for i in range(table_size-2,-1,-1):
  finv[i]=finv[i+1]*(i+1)%mod

def binom(n,k):
  if n<0 or k<0:
    return 0
  if k>n:
    return 0
  return (fac[n]*finv[k]%mod)*finv[n-k]%mod

def inv(a):
  if a<table_size:
    return fac[a-1]*finv[a]%mod
  b,u,v=mod,1,0
  while b:
    t=a//b
    a,b=b,a-t*b
    u,v=v,u-t*v
  return u%mod

n,m=map(int,input().split())
ans=0
for i in range(m):
  t,x,y=map(int,input().split())
  if t==1:
    ans-=binom(x+y,x)*binom(2*n-(x+y+1),n-(x+1))
  else:
    ans-=binom(x+y,x)*binom(2*n-(x+y+1),n-(y+1))
  ans%=mod

ans+=binom(2*n,n)*2*n
print(ans%mod)