#include <iostream>
#include <string>
using namespace std;
#include <algorithm>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <set>
#include <map>
#include <queue>
#include <cassert>
using ll = long long;
using ld = long double;
const ll MOD1 = 1000000007;
const ll MOD2 = 998244353;
const ll LIMIT1 = 200010;
const ll LIMIT2 = 500010;
const ll LIMIT3 = 1000010;
const int INF = ((1<<30)-1);
const ll LLINF = (1LL<<60);
const ld EPS = (1e-14);
using cv = const void;
using P = pair<ll,ll>;
#define rep(i,n) for((i)=0;(i)<(n);(i)++)
#define per(i,n) for((i)=(n)-1;(i)>=0;(i)--)
#define ALL(a) (a).begin(),(a).end()
#define ALL2(a, n) (a),(a)+(n)
template<class T,class C> T max(T a,C b){ return std::max(a, (T)b); }
template<class T,class C> T min(T a,C b){ return std::min(a, (T)b); }
template<class T,class C> bool chmax(T &a,const C b){ if(a<(T)b){ a=(T)b;return true; } return false; }
template<class T,class C> bool chmin(T &a,const C b){ if((T)b<a){ a=(T)b;return true; } return false; }
#define zt(a,b) (max((a),(b))-min((a),(b)))
#define setpre(n) fixed << setprecision(n)
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return (a/gcd(a,b))*b;}
#define YES(b) (b?"YES":"NO")
#define Yes(b) (b?"Yes":"No")
#define yes(b) (b?"yes":"no")
template<class T,class C> char gl(const T a,const C b){
  T bb = (T)b;
  if(a<bb) return '<';
  else if(a>bb) return '>';
  else return '=';
}
int dx[8]={1,0,-1,0,1,-1,-1,1},dy[8]={0,1,0,-1,1,1,-1,-1};
ll modpow(ll a, ll n, ll mod) {
  ll res = 1;
  while (n > 0) {
    if (n & 1){
      res *= a; if(mod>=1) res %= mod;
    }
    a *= a; if(mod>=1) a %= mod;
    n >>= 1;
  }
  return res;
}
void initialize(){
  
}
#define modinv(a,mod) modpow((a),(mod)-2,(mod))
struct ModComb{
  int MAX, MOD;
  vector<ll> fac, finv, inv;
  
  ModComb(int n = 510000, int m = 1000000007){
    if(m==0) m = MOD1;
    else if(m==1) m = MOD2;
    fac.resize(n);
    finv.resize(n);
    inv.resize(n);
    MAX = n;
    MOD = m;
    init();
  }
  // テーブルを作る前処理
  void init() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; 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;
    }
  }
  bool isERROR(int n){
    if(n<0 || n>=MAX) return true;
    
    return false;
  }
  bool isERROR2(int n, int k){
    if(n<0) return true;
    else if(n<0 || n>=MAX) return true;
    else if(k<0 || k>=MAX) return true;

    return false;
  }
  //階乗取得
  ll FACT(int n){
    if(isERROR(n)) return 0;
    return fac[n];
  }
  //階乗の逆元
  ll FACTinv(int n){
    if(isERROR(n)) return 0;
    return finv[n];
  }
  //二項係数計算
  ll COM(int n, int k){
    if(isERROR2(n, k)) return 0;
    return fac[n] * (finv[k] * finv[n-k] % MOD) % MOD;
  }
  //順列計算
  ll PERM(int n, int k){
    if(isERROR2(n, k)) return 0;
    return (fac[n] * finv[n-k]) % MOD;
  }
  //重複組み合わせ計算
  ll nHr(int n, int k){
    return COM(n+k-1,k);
  }
  int getMod(){
    return MOD;
  }
};
int main(void){
  initialize();
  ll n,m,i,j,k,result=0;
  string s;
  
  cin >> n >> m;
  ModComb mc(2*n+10, MOD1);
  result = 2*n;
  result *= mc.COM(2*n, n);//すべて有料の場合
  result %= MOD1;
  
  vector<ll> t(m), x(m), y(m);
  rep(i,m){
    cin >> t[i] >> x[i] >> y[i];
    ll tmp = mc.COM(x[i]+y[i], x[i]);
    if(t[i]==1){
      tmp *= mc.COM(2*n-x[i]-y[i]-1, n-y[i]);
    }else{
      tmp *= mc.COM(2*n-x[i]-y[i]-1, n-x[i]);
    }
    tmp %= MOD1;
    result -= tmp;
    if(result<0) result+=MOD1;
  }
  
  cout << result << endl;
  return 0;
}