import java.io.*; import java.util.*; public class Main { static final int MOD = 1000000007; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int m = sc.nextInt(); Combination cmb = new Combination(2 * n + 1); long ans = cmb.getComb(2 * n, n) * n * 2 % MOD; for (int i = 0; i < m; i++) { int type = sc.nextInt(); int x = sc.nextInt(); int y = sc.nextInt(); long minus; if (type == 1) { minus = cmb.getComb(x + y, x) * cmb.getComb(n - x - 1 + n - y, n - y) % MOD; } else { minus = cmb.getComb(x + y, x) * cmb.getComb(n - x + n - y - 1, n - y - 1) % MOD; } ans += MOD - minus; ans %= MOD; } System.out.println(ans); } } class Combination { static final int MOD = 1000000007; long[] fac; long[] finv; long[] inv; public Combination (int size) { fac = new long [size]; finv = new long [size]; inv = new long [size]; fac[0] = 1; fac[1] = 1; finv[0] = 1; finv[1] = 1; inv[1] = 1; for (int i = 2; i < size; i++) { fac[i] = fac[i - 1] * i % MOD; inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD; finv[i] = finv[i - 1] * inv[i] % MOD; } } public long getComb(int n, int k) { if (n < k || n < 0 || k < 0) { return 0; } return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD; } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public String next() throws Exception { if (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }