#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define int ll
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define ALL(a) (a).begin(), (a).end()
template <class t, class u> void chmax(t& a, u b) {
    if (a < b) a = b;
}
template <class t, class u> void chmin(t& a, u b) {
    if (b < a) a = b;
}
template <class t> using vc = vector<t>;
template <class t> using vvc = vc<vc<t>>;
using pi = pair<int, int>;
using vi = vc<int>;
using uint = unsigned;
using ull = unsigned long long;
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
ll mask(int i) { return (ll(1) << i) - 1; }
int lcm(int a, int b) { return a / __gcd(a, b) * b; }
using mint = atcoder::modint1000000007;
vc<mint> fact(1LL << 20), factinv(1LL << 20);
mint ncr(int n, int r) { return (fact[n] * factinv[r]) * factinv[n - r]; }
mint npr(int n, int r) { return fact[n] * factinv[n - r]; }
signed main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(20);
    int n, m;
    cin >> n >> m;
    fact[0] = 1;
    for (int i = 1; i <= 100100; i++) fact[i] = fact[i - 1] * i;
    for (int i = 0; i <= 100100; i++) factinv[i] = fact[i].inv();
    mint ans = 0;
    map<pi, int> mp;
    rep(i, m) {
        int t, x, y;
        cin >> t >> x >> y;
        mp[make_pair(x, y)] = t;
    }
    for (int i = 0; i <= n; i++) {
        for (int j = 0; j <= n; j++) {
            mint now = 0;
            if (i < n) {
                // yoko:=2
                if (mp[pi(i, j)] != 2) {
                    now += ncr(i + j, i) * ncr(2 * n - (i + 1 + j), n - j);
                }
            }
            if (j < n) {
                // tate:=1
                if (mp[pi(i, j)] != 1) {
                    now += ncr(i + j, i) * ncr(2 * n - (i + 1 + j), n - i);
                }
            }
            ans += now;
        }
    }
    cout << ans.val() << endl;
}