#include <iostream>

using namespace std;
using ll = long long;
const int MX = 400010;
ll f[MX],inv[MX],fi[MX];
constexpr ll mod = 1000000007;
void solve(){
    inv[1] = 1;
    for(int i=2;i<MX;i++){
        inv[i] = mod - (mod/i)*inv[mod%i]%mod;
    }
    f[0] = fi[0] = 1;
    for(int i=1;i<MX;i++){
        f[i] = f[i-1]*i%mod;
        fi[i] = fi[i-1]*inv[i]%mod;
    }
}

ll nck(ll n, ll k){
    if(n<0 || k<0 || n<k) return 0;
    return f[n]*fi[k]%mod*fi[n-k]%mod;
}

int main(){
    ll i,n,m; cin >> n >> m;
    solve();
    ll ans = 2*n*nck(2*n,n)%mod;
    for(i=0;i<m;i++){
        int t,x,y; cin >> t >> x >> y;
        if(t==1){
            (ans += mod - nck(x + y,y)*nck(2*n - x - y - 1,n - y)%mod) %= mod;
        }else{
            (ans += mod - nck(x + y,y)*nck(2*n - x - y - 1,n - x)%mod) %= mod;
        }
    }
    cout << ans << endl;
}