#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<cmath>
#define N 100000
#define mod 998244353
using namespace std;
const int inv2=(mod+1)>>1;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
struct reads
{
	int l,r,d;
};
reads tong[N+1];
int n,q,length,ans,invpw[N+1],op[N+1],l[N+1],r[N+1],x[N+1];
int main()
{
	invpw[0]=1;
	for (int i=1;i<=N;++i) invpw[i]=1ll*invpw[i-1]*inv2%mod;
	n=read(),q=read();
	for (int i=1;i<=q;++i)
	{
		op[i]=read();
		if (op[i]==1) l[i]=read(),r[i]=read();
		else x[i]=read();
	}
	for (int i=1;i<=q;++i)
		if (op[i]==1)
		{
			tong[length=1]=(reads){l[i],r[i],0};
			for (int j=i+1;j<=q;++j)
				if (op[j]==2)
				{
					for (int k=1;k<=length;++k)
						if (tong[k].l<x[j]&&x[j]<tong[k].r)
						{
							tong[k].r=x[j],tong[k].d++,tong[++length]=(reads){x[i],tong[k].r,tong[k].d+1};
							break;
						}
				}
			for (int j=1;j<=length;++j) Adder(ans,1ll*(tong[j].r-tong[j].l)*invpw[tong[j].d]%mod);
		}
	printf("%d\n",ans);
	return 0;
}