#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>

#define ll long long
#define mk make_pair
#define fi first
#define se second

using namespace std;

inline int read(){
	int x=0,f=1;char c=getchar();
	for(;(c<'0'||c>'9');c=getchar()){if(c=='-')f=-1;}
	for(;(c>='0'&&c<='9');c=getchar())x=x*10+(c&15);
	return x*f;
}

const int mod=998244353;
int ksm(int x,ll y,int p=mod){
	int ans=1;y%=(p-1);
	for(int i=y;i;i>>=1,x=1ll*x*x%p)if(i&1)ans=1ll*ans*x%p;
	return ans%p;
}
int inv(int x,int p=mod){return ksm(x,p-2,p)%p;}
mt19937 rnd(time(0));
int randint(int l,int r){return rnd()%(r-l+1)+l;}
void add(int &x,int v){x+=v;if(x>=mod)x-=mod;}
void Mod(int &x){if(x>=mod)x-=mod;}
int cmod(int x){if(x>=mod)x-=mod;return x;}

template<typename T>void cmax(T &x,T v){x=max(x,v);}
template<typename T>void cmin(T &x,T v){x=min(x,v);}

const int N=50005;
const int INF=1e9;
struct zkw{
	int d[N<<2];int M,k;
	void build(int n){
		M=1,k=0;while(M<n)M<<=1,k++;
		for(int i=1;i<=M*2-1;i++)d[i]=INF;
	}
	void pushup(int p){d[p]=min(d[p<<1],d[p<<1|1]);}
	void setv(int p,int v){
		d[p+=M-1]=v;
		for(int i=1;i<=k;i++)pushup(p>>i);
	}
	int qmin(int l,int r){
		int res=1e9;
		for(l+=M-1,r+=M;l<r;l>>=1,r>>=1){
			if(l&1)cmin(res,d[l++]);
			if(r&1)cmin(res,d[--r]);
		}
		return res;
	}
}T;

int n,Q;
int op[N],tx[N],tl[N],tr[N];

const int Iv=inv(2);
const int B=2500;
int ans[N][B],tim[N][B],now,pre;
int qry(int l,int r){
	if(r-l<=1)return r-l;
	if(r-l<B){
		if(tim[l][r-l]<=pre)return ans[l][r-l];
		tim[l][r-l]=now;
		int t=T.qmin(l+1,r-1);
		if(t>Q)return ans[l][r-l]=r-l;
		int p=tx[t];
		return ans[l][r-l]=1ll*Iv*(qry(l,p)+qry(p,r))%mod;
	}
	else{
		int t=T.qmin(l+1,r-1);
		if(t>Q)return r-l;
		int p=tx[t];
		return 1ll*Iv*(qry(l,p)+qry(p,r))%mod;
	}
}

signed main(void){

#ifndef ONLINE_JUDGE
	// freopen("a1.in","r",stdin);
	freopen("in.txt","r",stdin);
#endif

	n=read(),Q=read();
	for(int i=1;i<=Q;i++){
		op[i]=read();
		if(op[i]==1)tl[i]=read(),tr[i]=read();
		else tx[i]=read();
	}

	int ans=0;T.build(n);memset(tim,63,sizeof(tim));
	pre=n+1;
	for(int i=Q;i>=1;i--){
		now=i;
		// cout<<"now i = "<<i<<endl;
		if(op[i]==1)add(ans,qry(tl[i],tr[i]));
		else T.setv(tx[i],i),pre=i;
	}
	cout<<ans<<endl;

	return 0;
}