There are N squares arranged in a row. The squares are numbered 1, 2, ..., N, from left to right.

Snuke is painting each square in red, green or blue. According to his aesthetic sense, the following M conditions must all be satisfied. The i-th condition is:

* There are exactly x_i different colors among squares l_i, l_i + 1, ..., r_i.



In how many ways can the squares be painted to satisfy all the conditions? Find the count modulo 10^9+7.

Constraints

* 1 ≤ N ≤ 300
* 1 ≤ M ≤ 300
* 1 ≤ l_i ≤ r_i ≤ N
* 1 ≤ x_i ≤ 3

Input

Input is given from Standard Input in the following format:


N M
l_1 r_1 x_1
l_2 r_2 x_2
:
l_M r_M x_M


Output

Print the number of ways to paint the squares to satisfy all the conditions, modulo 10^9+7.

Examples

Input

3 1
1 3 3


Output

6


Input

4 2
1 3 1
2 4 2


Output

6


Input

1 3
1 1 1
1 1 2
1 1 3


Output

0


Input

8 10
2 6 2
5 5 1
3 5 2
4 7 3
4 4 1
2 3 1
7 7 1
1 5 2
1 7 3
3 4 2


Output

108
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn=305;
const int mod=1e9+7;
vector<pair<int,int> >vec[maxn];
int n,m,dp[305][305][305],d[4];
void add(int &x,int y)
{
	x+=y;
	if(x>=mod)x-=mod;
}
bool check(int a,int b,int c)
{
	d[1]=a;d[2]=b;d[3]=c;
	sort(d+1,d+4);
	for(int i=0;i<vec[d[3]].size();++i)
	{
		pair<int,int>p=vec[d[3]][i];
		int now=1;
		if(p.first<=d[2])now++;
		if(p.first<=d[1])now++;
		if(now!=p.second)return 0;
	}return 1;
}
signed main()
{
	 scanf("%lld%lld",&n,&m);
	 for(int i=1;i<=m;++i)
	 {
	 	int l,r,x;
	 	scanf("%lld%lld%lld",&l,&r,&x);
	 	vec[r].push_back(make_pair(l,x));
	 }
	 dp[0][0][0]=1;
	 for(int i=0;i<n;++i)
	 {
	 	for(int j=0;j<n;++j)
	 	{
	 		for(int k=0;k<n;++k)
	 		{
	 			int mx=max(max(i,j),k);
	 			if(check(mx+1,j,k))add(dp[mx+1][j][k],dp[i][j][k]);
	 			if(check(i,mx+1,k))add(dp[i][mx+1][k],dp[i][j][k]);
	 			if(check(i,j,mx+1))add(dp[i][j][mx+1],dp[i][j][k]);
			}
		}
	 }
	 int res=0;
	 for(int i=0;i<=n;++i)
	 {
	 	for(int j=0;j<=n;++j)
	 	{
	 		for(int k=0;k<=n;++k)
	 		{
	 			if(i==n||j==n||k==n)add(res,dp[i][j][k]);
			 }
		 }
	 }
	 cout<<res<<endl;
}