n, m = map(int, input().split())
mod = 10 ** 9 + 7

fact = [1 for i in range(2 * n + 1)]
inv = [1 for i in range(2 * n + 1)]
fact_inv = [1 for i in range(2 * n + 1)]
for i in range(2, 2 * n + 1):
    fact[i] = (fact[i - 1] * i) % mod
    inv[i]  = ((- inv[mod % (i)]) * (mod // i)) % mod
    fact_inv[i] = (fact_inv[i - 1] * inv[i]) % mod

def c(x, y):
    return (fact[x + y] * fact_inv[x] * fact_inv[y]) % mod

ans = (c(n, n) * 2 * n) % mod

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

print(ans)