#include<bits/stdc++.h>
#define fir first
#define sed second
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
const int N=310;
const LL mod=998244353;
LL dp[N][N][N];
int n,m;
vector<PII> v[N];
int main()
{
	scanf("%d %d",&n,&m);
	for(int i=1;i<=m;i++){
		int xx,yy,zz;
		scanf("%d %d %d",&xx,&yy,&zz);
		v[yy].push_back(make_pair(xx,zz));
	}
	dp[0][0][0]=1;
	for(int i=1;i<=n;i++)
	{
		for(int j=0;j<i;j++)
		{
			for(int k=0;k<=j;k++)
			{
				LL tmp=dp[k][j][i-1];
				dp[k][j][i]=(dp[k][j][i]+tmp)%mod;
				dp[k][i-1][i]=(dp[k][i-1][i]+tmp)%mod;
				dp[j][i-1][i]=(dp[j][i-1][i]+tmp)%mod;
			}
		}
		int len=v[i].size();
		for(int p=0;p<len;p++)
		{
			for(int j=0;j<i;j++)
			{
				for(int k=0;k<=j;k++)
				{
					int L=v[i][p].fir;
					int tmp=1;
					if(j>=L) tmp++;
					if(k>=L) tmp++;
					if(tmp!=v[i][p].sed) dp[k][j][i]=0;
				}
			}
		}
	}
	LL ans=0;
	for(int j=0;j<n;j++)
		for(int k=0;k<=j;k++)
			ans=(ans+dp[k][j][n])%mod;
	printf("%lld\n",ans);
	return 0;
}