#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include<queue>
using namespace std;
int m,n,ans=0,q;
const int  maxn=100010;
const long long pi=998244353;
queue<int>k;
vector<int>a[maxn];
int main()
{
	freopen("tria.in","r",stdin);
	freopen("tria.out","w",stdout);
	cin>>n>>m;
	int op,u,v;
	for(int i=1;i<=n;i++)
	{
		int j=i+1;
		while(j<=n)
		{a[i].push_back(j);j++;}
	}
	
	if(m!=0)
	for(int i=0;i<m;i++)
	{
		cin>>op>>u>>v;
		if(u>v){int yy=u;u=v;v=yy;}
		int w=v-u-1;
		if(op==0)a[u][w]=-1;
		if(op==1)a[u][w]=-5;
	}
	for(int i=1;i<=n;i++)
	{
		int j=i+1;
		while(j<=n-i-1)
		if(a[i][j]!=-1)k.push(a[i][j]);
	}
	int kk=k.size();
	if(m==0)cout<<(n+1)%pi;
	else cout<<kk%pi;
	return 0;
}