#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
template<typename T> bool chmax(T &x, const T &y) {return (x<y)?(x=y,true):false;};
template<typename T> bool chmin(T &x, const T &y) {return (x>y)?(x=y,true):false;};
constexpr ll MOD=1000000007;
constexpr ll INF=2e18;

const int MAX=510000;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit(){
    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;
    }
}
ll COM(int n, int k){
    if(n<k) return 0;
    if(n<0||k<0) return 0;
    return fac[n]*(finv[k]*finv[n-k]%MOD)%MOD;
}

int main(){
    COMinit();
    ll n, m; cin >> n >> m;
    ll ans=COM(n+n,n)*(n+n)%MOD;
    ll t, x, y;
    REP(i,m){
        cin >> t >> x >> y;
        if(t==1){
            ans-=COM(x+y,x)*COM((n-x-1)+(n-y),(n-x-1))%MOD;
            ans=(ans+MOD)%MOD;
        }
        else{
            ans-=COM(x+y,x)*COM((n-x)+(n-y-1),(n-x))%MOD;
            ans=(ans+MOD)%MOD;
        }
    }
    cout << ans << endl;
    return 0;
}