// #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include <atcoder/all>
#define rep(i, n) for (long long i = 0; i < (n); i++)
#define rep1(i, n) for(long long i = 1; i <= (n); i++)
#define all(v) v.begin(),v.end()
#define decimal(n) cout << fixed << setprecision(n);
using namespace std; 
using namespace atcoder;
using ll = long long; using vl = vector<ll>; using P = pair<ll,ll>;
using vvl = vector<vl>; using vc = vector<char>; using vvc = vector<vc>;
// using mint = modint998244353;
using mint = modint1000000007;
const ll MOD = 1000000007;
const ll MAX = 2000100; const ll inf = 3e18; const long double pi = acos(-1);
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
ll lcm(ll a,ll b){ return (a*b) / gcd(a,b); }

mint fac[MAX], finv[MAX], inv[MAX];
void nCrprep() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (ll i = 2; i < MAX; i++){
    fac[i] = fac[i - 1] * i;
    inv[i] = MOD - inv[MOD%i] * (MOD / i);
    finv[i] = finv[i - 1] * inv[i];
  }
}
mint nCr(ll n, ll r){
  if (n < r) return 0;
  if (n < 0 || r < 0) return 0;
    return fac[n] * (finv[r] * finv[n - r] );
}
ll nCrcheep(ll n,ll r){
  if(r == 0) return 1;
  else if(r == 1) return n;
  else return nCrcheep(n-1,r-1)*n/r;
}

int main(){
  nCrprep();
  ll n,m; cin >> n >> m;
  mint ans = 0;
  ans += 2 * n * nCr(2 * n, n);

  rep(i, m){
    ll t,x,y; cin >> t >> x >> y;
    if(t == 1) ans -= nCr(x + y, x) * nCr(2 * n - x - y - 1, n - y);
    else ans -= nCr(x + y, x) * nCr(2 * n - x - y - 1, n - x);
  }

  cout << ans.val() << endl;

}