#include <bits/stdc++.h>
#include <atcoder/all>
#define ll long long int
#define INF 1000000000000000000
#define N 400000
#define pll pair<ll,ll>
using namespace atcoder;
using namespace std;
using mint = modint1000000007;
ostream &operator<<(std::ostream &os, mint p){
  os << p.val();
  return os;
}
vector<mint> p(N+1, 0), inv(N+1, 0);
void init(){
  p[0] = 1;
  inv[0] = 1;
  for (ll i = 1; i < N+1; i++){
    p[i] = i*p[i-1];
    inv[i] = inv[i-1]/i;
  }
}

int main(void){
  init();
  ll n, m;
  cin >> n >> m;
  set<pll> rs, cs;
  mint ans = 2*n*p[2*n]*inv[n]*inv[n];
  for (ll i = 0; i < m; i++){
    ll c, x, y;
    cin >> c >> x >> y;
    mint t = 1;
    if (c == 1){
      t *= p[x+y]*inv[x]*inv[y];
      t *= p[2*n-x-y-1]*inv[n-x-1]*inv[n-y];
    }
    else {
      t *= p[x+y]*inv[x]*inv[y];
      t *= p[2*n-x-y-1]*inv[n-x]*inv[n-y-1];
    }
    ans -= t;
  }
  cout << ans << endl;



  /*
  vector<vector<mint>> dp(n, vector<mint>(n, 0));
  vector<vector<mint>> dp2(n, vector<mint>(n, 0));
  dp[0][0] = 1;
  dp2[0][0] = 0;
  for (ll i = 0; i < n; i++){
    for (ll j = 0; j < n; j++){
      if (i != n-1){
        dp[i+1][j] += dp[i][j];
        dp2[i+1][j] += dp2[i][j] + (rs.count(pll(i, j)) ? 0 : dp[i][j]);
      }
      if (j != n-1){
        dp[i][j+1] += dp[i][j];
        dp2[i][j+1] += dp2[i][j] + (cs.count(pll(i, j)) ? 0 : dp[i][j]);
      }
    }
  }
  cout << dp2[n-1][n-1] << endl;
  */


  return 0;
}