#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000001

struct combi{
	deque<mint> kaijou;
	deque<mint> kaijou_;
	
	combi(int n){
		kaijou.push_back(1);
		for(int i=1;i<=n;i++){
			kaijou.push_back(kaijou[i-1]*i);
		}
		
		mint b=kaijou[n].inv();
		
		kaijou_.push_front(b);
		for(int i=1;i<=n;i++){
			int k=n+1-i;
			kaijou_.push_front(kaijou_[0]*k);
		}
	}
	
	mint combination(int n,int r){
		if(r>n)return 0;
		mint a = kaijou[n]*kaijou_[r];
		a *= kaijou_[n-r];
		return a;
	}
	
	mint junretsu(int a,int b){
		mint x = kaijou_[a]*kaijou_[b];
		x *= kaijou[a+b];
		return x;
	}
	
	mint catalan(int n){
		return combination(2*n,n)/(n+1);
	}
	
};


int main(){
	
	combi C(1000000);
	
	int N,M;
	cin>>N>>M;
	
	mint ans = C.junretsu(N,N) * (N*2);
	
	rep(_,M){
		int t,x,y;
		scanf("%d %d %d",&t,&x,&y);
		
		mint cur = C.junretsu(x,y);
		if(t==1){
			cur *= C.junretsu((N-(x+1)),(N-y));
		}
		else{
			cur *= C.junretsu((N-x),(N-(y+1)));
		}
		ans -= cur;
		
	}
	
	cout<<ans.val()<<endl;
	
	return 0;
}