/* -*- coding: utf-8 -*-
 *
 * 1596.cc:  No.1596 Distance Sum in 2D Plane - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 200000;
const int MAX_N2 = MAX_N * 2;
const int MOD = 1000000007;

/* typedef */

typedef long long ll;

/* global variables */

int fs[MAX_N2 + 1], invfs[MAX_N2 + 1];

/* subroutines */

int powmod(int a, int n) {  // a^n % MOD
  int pm = 1;
  while (n > 0) {
    if (n & 1) pm = (ll)pm * a % MOD;
    a = (ll)a * a % MOD;
    n >>= 1;
  }
  return pm;
}

inline int nck(int n, int k) {  // nCk % MOD
  return (ll)fs[n] * invfs[n - k] % MOD * invfs[k] % MOD;
}

void prepare_fracs(int n) {
  fs[0] = invfs[0] = 1;
  for (int i = 1; i <= n; i++) {
    fs[i] = (ll)fs[i - 1] * i % MOD;
    invfs[i] = powmod(fs[i], MOD - 2);
  }
}

/* main */

int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  int n2 = n * 2;

  prepare_fracs(n2);

  int sum = 0;
  while (m--) {
    int ti, xi, yi;
    scanf("%d%d%d", &ti, &xi, &yi);

    int dx, dy;
    if (ti == 1)
      dx = n - (xi + 1), dy = n - yi;
    else
      dx = n - xi, dy = n - (yi + 1);
    sum = (sum + (ll)nck(xi + yi, xi) * nck(dx + dy, dx) % MOD) % MOD;
  }

  int ans = ((ll)n2 * nck(n2, n) % MOD + MOD - sum) % MOD;
  printf("%d\n", ans);
  return 0;
}