#ifdef _DEBUG
    #include <atcoder/all.h>
    #define debug(x) std::cout << #x << ": " << x << std::endl
#else
    #include <bits/stdc++.h>
    #include <atcoder/all>
    //#pragma GCC target("arch=skylake-avx512")
    #pragma GCC optimize("O3")
    #pragma GCC optimize("unroll-loops")
    #define debug(x)
#endif
using namespace std;
using namespace atcoder;
using ll = long long;
#define rep(...) _overloadrep(__VA_ARGS__, _rep4, _rep3, _rep2)(__VA_ARGS__)
#define _overloadrep(_1, _2, _3, _4, _repn, ...) _repn
#define _rep2(i, n) _rep4(i, 0, n, 1)
#define _rep3(i, a, b) _rep4(i, a, b, 1)
#define _rep4(i, a, b, s) for (auto i = (a); i < (b); i += (s))
#define repr(i, a, b) for (auto i = (b)-1; i >= (a); --i)
#define all(x) (x).begin(), (x).end()
#define siz(x) int((x).size())
template<class T1, class T2> inline bool chmax(T1 &a, const T2 &b) { if (a < b) { a = b; return true; } return false; }
template<class T1, class T2> inline bool chmin(T1 &a, const T2 &b) { if (a > b) { a = b; return true; } return false; }
constexpr char enl = '\n';
constexpr int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
constexpr int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr long double eps = 1e-10;
constexpr int INF = 1010000000;  // 1e9
constexpr ll llINF = 3010000000000000000LL;  // 3e18
constexpr ll MOD = 1000000007LL;
//constexpr ll MOD = 998244353LL;
using mint = static_modint<MOD>;

constexpr int MAX_COM = 2'100'000;  // 2e6
mint COM(int n, int k) {
    // 二項係数nCkのMODを求める
    // 前計算O(n),クエリO(1)
    // 制約: MODは素数, MOD > n

    static bool init = true;
    static mint fac[MAX_COM], finv[MAX_COM], inv[MAX_COM];

    // テーブルを作る前処理
    if (init) {
        assert(mint::mod() > MAX_COM);
        init = false;
        fac[0] = fac[1] = 1;
        finv[0] = finv[1] = 1;
        inv[1] = 1;
        for (int i = 2; i < MAX_COM; i++) {
            fac[i] = fac[i - 1] * i;
            inv[i] = -inv[mint::mod() % i] * (mint::mod() / i);
            finv[i] = finv[i - 1] * inv[i];
        }
    }

    // 二項係数計算
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    assert(n < MAX_COM);
    return fac[n] * finv[k] * finv[n - k];
}

void Main([[maybe_unused]] int testcase_i) {
    int n, m; cin >> n >> m;
    mint ans = 2*n * COM(2*n, n);
    rep(i, m) {
        int t, x, y; cin >> t >> x >> y;
        if (t == 1) ans -= COM(x+y, x) * COM(2*n-x-y-1, n-y);
        else ans -= COM(x+y, x) * COM(2*n-x-y-1, n-x);
    }
    cout << ans.val() << enl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);
    int t = 1;
    //cin >> t;
    rep(i, t) Main(i);
}