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

def perm(n,r,p):
  if (r < 0) or (n < r):
    return 0
  return fac[n]*finv[n-r]%p

NN = 440000
MOD = pow(10,9) + 7

fac = [-1]*(NN+1); fac[0] = 1; fac[1] = 1 #階乗
finv = [-1]*(NN+1); finv[0] = 1; finv[1] = 1 #階乗の逆元
inv = [-1]*(NN+1); inv[0] = 0; inv[1] = 1 #逆元
for i in range(2,NN+1):
  fac[i] = fac[i-1]*i%MOD
  inv[i] = MOD - inv[MOD%i]*(MOD//i)%MOD
  finv[i] = finv[i-1]*inv[i]%MOD

def main():
    N,M = map(int,input().split())
    ans = cmb(N*2,N,MOD)*(2*N) #全体
    for i in range(M):
        t,x,y = map(int,input().split())
        if t == 1:
            #右移動
            temp = cmb(x+y,x,MOD)*cmb(N-(x+1)+N-y,N-y,MOD)
            ans -= temp%MOD
        else:
            #上移動
            temp = cmb(x+y,x,MOD)*cmb(N-(y+1)+N-x,N-x,MOD)
            ans -= temp%MOD
        ans %= MOD
    print(ans%MOD)

if __name__ == '__main__':
    main()