n,m = map(int,input().split())
n *= 2
fac_arr = [1] * (n+1)
r_s_fac_arr = [1] * (n+1)
mod = 10 ** 9 + 7
for i in range(1,n+1):
    fac_arr[i] = (fac_arr[i-1] % mod) * i % mod
    r_s_fac_arr[i] = (r_s_fac_arr[i-1] % mod) * pow(i,mod-2,mod) % mod 
def nckMod(n,k):
    return fac_arr[n]  % mod *  r_s_fac_arr[k] % mod * r_s_fac_arr[n-k] % mod
ans = nckMod(n,n//2) * n
n //= 2
for i in range(m):
    t,x,y = map(int,input().split())
    n1 ,c1 = x + y,min(x,y)
    if t == 1:
        n2,c2 = n - (x + 1) + n - y  , n-y
    else:
        n2,c2 = n - (y + 1) + n - x  , n-x
    ans -= nckMod(n1,c1) * nckMod(n2,c2)
print(ans % mod)