#include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>

using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);

#define l_ength size

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

void add_mod(ll& a, ll b){
	a = (a<MOD)?a:(a-MOD);
	b = (b<MOD)?b:(b-MOD);
	a += b;
	a = (a<MOD)?a:(a-MOD);
}

ll fc[410410]={1ll},nv[410410]={1ll};

ll rwpw(ll a, ll p = MOD-2){
	ll ret = 1ll;
	while(p){
		if(p%2){
			mul_mod(ret,a);
		}
		mul_mod(a,a);
		p /= 2;
	}
	return ret;
}

ll c(int n, int k){
	ll ret = fc[n];
	mul_mod(ret,nv[k]);
	mul_mod(ret,nv[n-k]);
	return ret;
}

int main(void){
	int n,i,m,t,x,y;
	ll ans,tmp;
	for(i=1; i<410410; ++i){
		fc[i] = fc[i-1]*i%MOD;
		nv[i] = rwpw(fc[i]);
	}
	std::cin >> n >> m;
	ans = c(n*2,n);
	mul_mod(ans,n*2);
	for(i=0; i<m; ++i){
		std::cin >> t >> x >> y; --t;
		tmp = c(x+y,x);
		if(t){
			++y;
		}else{
			++x;
		}
		x = n-x; y = n-y;
		mul_mod(tmp,c(x+y,y));
		add_mod(ans,MOD-tmp);
	}
	std::cout << ans << std::endl;
	return 0;
}