n,m = map(int,input().split())
mod = 10**9+7
f = [i for i in range(2*n+1)]
f[0] = 1
for i in range(2*n):
	f[i+1] *= f[i]
	f[i+1] %= mod
fv = []
for i in range(2*n+1):
	fv.append(pow(f[i],mod-2,mod))
ans = f[2*n]*fv[n]%mod*fv[n]%mod*2*n%mod
for _ in range(m):
	t,x,y = map(int,input().split())
	if t==1:
		ans -= f[x+y]*fv[x]%mod*fv[y]%mod*f[2*n-x-y-1]*fv[n-x-1]%mod*fv[n-y]%mod
		ans %= mod
	else:
		ans -= f[x+y]*fv[x]%mod*fv[y]%mod*f[2*n-x-y-1]*fv[n-x]%mod*fv[n-y-1]%mod
		ans %= mod
print(ans)