#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;

const ll mod = 1000000007;
vector<ll> fact, fact_inv, inv;

void init_nCk(int size){
    fact.resize(size + 5);
    fact_inv.resize(size + 5);
    inv.resize(size + 5);
    fact[0] = fact[1] = 1;
    fact_inv[0] = fact_inv[1] = 1;
    inv[1] = 1;
    for(ll i = 2; i <= size; i++){
        fact[i] = fact[i - 1] * i % mod;
        inv[i] = mod - inv[mod % i] * (mod / i) % mod;
        fact_inv[i] = fact_inv[i - 1] * inv[i] % mod;
    }
}

int main(){
    ll N, M; cin >> N >> M;
    init_nCk(2 * N);
    ll ans = 2LL * N * (fact[2 * N] * fact_inv[N] % mod * fact_inv[N] % mod) % mod;
    for(int i = 0; i < M; i++){
        ll t, x, y; cin >> t >> x >> y;
        if(t == 1){
            ll comb = (fact[x + y] * fact_inv[x] % mod * fact_inv[y] % mod) * (fact[2 * N - (x + y + 1)] * fact_inv[N - (x + 1)] % mod * fact_inv[N - y] % mod) % mod;
            ans = (mod + ans - comb) % mod;
        }
        if(t == 2){
            ll comb = (fact[x + y] * fact_inv[x] % mod * fact_inv[y] % mod) * (fact[2 * N - (x + y + 1)] * fact_inv[N - x] % mod * fact_inv[N - (y + 1)] % mod) % mod;
            ans = (mod + ans - comb) % mod;
        }
    }
    cout << ans << endl;
}