MOD = 10**9+7
def conv(s,t)
  return 0 if (s < t) || (s < 0) || (t < 0)
  (FACT[s] * FINV[s-t] % MOD) * FINV[t] % MOD
end

FACT = []
INV = []
FINV = []

def calc_fact(n)
  FACT[0] = 1
  FACT[1] = 1
  INV[0] = 1
  INV[1] = 1
  FINV[0] = 1
  FINV[1] = 1
  for i in 2..n
    FACT[i] = (FACT[i-1] * i) % MOD
    INV[i] = (INV[MOD%i] * (MOD - MOD/i)) % MOD
    FINV[i] = (FINV[i-1] * INV[i]) % MOD
  end
end

n,m = gets.chomp.split(" ").map(&:to_i)
calc_fact(n*2)
cnt = conv(2*n,n) * 2*n
cnt %= MOD
m.times do
  t,x,y = gets.chomp.split(" ").map(&:to_i)
  if t == 1
    sub = conv(x+y,x)*conv(2*n-(x+1)-y,n-y)
    sub %= MOD
  else
    sub = conv(x+y,x)*conv(2*n-(y+1)-x,n-x)
    sub %= MOD
  end
  cnt -= sub
  cnt %= MOD
end
p cnt