#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int INF = (1<<30)-1;
const ll LINF = (1LL<<60)-1;

#define rep(i, n) for (int i = 0; i < n; i++)
#define sz(a) (int)(a.size())

template<class T> 
bool chmax(T &a, T b) {if (a < b) {a = b;return true;}else return false;}

template<class T> 
bool chmin(T &a, T b) {if (a > b) {a = b;return true;}else return false;}

#define MAX (ll)1e6+1    //nCrのnの最大値+1

ll fac[MAX], inv[MAX], finv[MAX];

void COMinit(ll mod) {
    fac[0] = 1, finv[0] = 1;
    fac[1] = 1, inv[1] = 1, finv[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) % mod;
        finv[i] = finv[i-1] * inv[i] % mod;
    }
}

ll COM(ll n, ll k, ll mod) {
    if (n < k)
        return 0;
    if (n < 0 || k < 0)
        return 0;
    return fac[n] * finv[k] % mod * finv[n-k] % mod;
}


//コーナーケースに気をつけろ！
int main() {
    int n, m;   cin >> n >> m;
    ll mod = 1e9+7;
    COMinit(mod);
    ll ans = 2*n * COM(2*n, n, mod) % mod;
    rep(i, m) {
        int x, y, t;    cin >> t >> x >> y;
        if (t == 1) {
            ans = (ans + mod - COM(x+y, x, mod) * COM(2*n-1-x-y, n-y, mod) % mod) % mod;
        }
        else {
            ans = (ans + mod - COM(x+y, x, mod) * COM(2*n-1-x-y, n-x, mod) % mod) % mod;
        }
    }
    cout << ans << endl;
    return 0;   
}

//小数点精度
//cout << fixed << std::setprecision(15) << y << endl;