def cmb(n, r, mod):
    if ( r<0 or r>n ):
        return 0
    r = min(r, n-r)
    return g1[n] * g2[r] * g2[n-r] % mod

n,m = map(int,input().split())
txy = [[int(i) for i in input().split()] for j in range(m)]

N = 2*n

mod = 10**9+7 #出力の制限
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル

for i in range( 2, N + 1 ):
    g1.append( ( g1[-1] * i ) % mod )
    inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
    g2.append( (g2[-1] * inverse[-1]) % mod )

a = cmb(N,n,mod)
ans = a*N
ans %= mod

for i in range(m):
    bfr = cmb(txy[i][1]+txy[i][2],txy[i][1],mod)
    bfr %= mod
    if txy[i][0] == 1:
        txy[i][1] += 1
    else:
        txy[i][2] += 1
    wa = txy[i][1]+txy[i][2]
    ngs = N - (wa)
    tate = n - txy[i][1]
    aft = cmb(ngs,tate,mod)
    aft %= mod
    ans -= (bfr*aft) % mod
    ans %= mod

print(ans%mod)