#include<cstdio>
#include<vector>
#include<atcoder/modint>
using namespace std;
using namespace atcoder;
using Mint = modint1000000007;

int main(){
    unsigned N, M;
    scanf("%u %u", &N, &M);
    vector<Mint> kaijou((N<<1)+1);
    kaijou[0] = Mint::raw(1);
    for (unsigned i = 0; i < N<<1; i++){
        kaijou[i+1] = kaijou[i]*Mint::raw(i+1);
    }
    vector<Mint> rev_kaijou((N<<1)+1);
    rev_kaijou[N<<1] = kaijou[N<<1].inv();
    for (unsigned i = N<<1; i > 0; i--){
        rev_kaijou[i-1] = rev_kaijou[i]*Mint::raw(i);
    }
    Mint answer = Mint::raw(N<<1)*kaijou[N<<1]*rev_kaijou[N]*rev_kaijou[N];
    for (unsigned i = 0; i < M; i++){
        unsigned t, x, y;
        scanf("%u %u %u", &t, &x, &y);
        answer -= kaijou[x+y]*rev_kaijou[x]*rev_kaijou[y]*kaijou[(N<<1) - x - y - 1]*(t == 1 ? rev_kaijou[N - x - 1]*rev_kaijou[N - y] :(rev_kaijou[N - y - 1]*rev_kaijou[N - x]));
    }
    printf("%u\n", answer.val());
	return 0;
}