#include <bits/stdc++.h>
using namespace std;

#define MOD 1000000007

long long mod_inv(long long n) {
  long long left = MOD-2; //define MOD
  long long ks = n;
  long long ans = 1;
  while (left != 0) {
    if (left%2 == 1) ans = ans*ks%MOD;
    left /= 2;
    ks = ks*ks%MOD;
  }
  return ans;
}

int main() {
  
  ios::sync_with_stdio(false);
  cin.tie(0);
  
  int n,m;
  cin >> n >> m;
  vector<int> t(m),x(m),y(m);
  for (int i=0;i<m;i++) {
    cin >> t[i] >> x[i] >> y[i];
  }
  vector<long long> fact(n*2+1,1);
  for (int i=2;i<=n*2;i++) {
    fact[i] = fact[i-1]*i%MOD;
  }
  long long ans = fact[2*n]*mod_inv(fact[n])%MOD*mod_inv(fact[n])%MOD;
  ans = ans*2*n%MOD;
  for (int i=0;i<m;i++) {
    int x1 = x[i];
    int y1 = y[i];
    int tx,ty;
    if (t[i] == 1) {
      tx = x[i]+1;
      ty = y[i];
    }
    if (t[i] == 2) {
      tx = x[i];
      ty = y[i]+1;
    }
    int x2 = n-tx;
    int y2 = n-ty;
    //cout << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << endl;
    long long r1 = fact[x1+y1]*mod_inv(fact[x1])%MOD*mod_inv(fact[y1])%MOD;
    long long r2 = fact[x2+y2]*mod_inv(fact[x2])%MOD*mod_inv(fact[y2])%MOD;
    long long rm = r1*r2%MOD;
    ans = (ans-rm+MOD)%MOD;
  }
  cout << ans << endl;
}