// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define ull unsigned long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}
 
#define mod 998244353
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f

modint res,inv2=(mod+1)/2;

int n,m;
int qop[maxn],ql[maxn],qr[maxn],qx[maxn];
int pri[maxn];

struct dat{
	modint k,b;
	dat(modint X=1,modint Y=0){k=X,b=Y;}
	void operator *=(modint x){
		k*=x,b*=x;
	}
};
dat operator *(dat a,dat b){
	return dat(a.k*b.k,a.b*b.k+b.b);
}

#define ls(x) ch[x][0]
#define rs(x) ch[x][1]

bool bo[maxn];
int root,par[maxn],ls[maxn],rs[maxn];

struct node{
	dat l,r,all;
	void operator *=(modint x){
		if(l.b.x)l*=x;
		if(r.b.x)r*=x;
		all*=x;
	}
};
node operator *(node a,node b){
	return (node){a.l*b.l,a.r*b.r,a.all*b.all};
};
node val[maxn],sval[maxn];
modint sl[maxn],sr[maxn];
bool ext[maxn];
int ch[maxn][2],fa[maxn],top[maxn];

bool nrt(int p){
	return rs(fa[p])==p||ls(fa[p])==p;
}
bool chk(int p){
	return rs(fa[p])==p;
}

void up(int p){
	int l=ch[p][0],r=ch[p][1];
	sval[p]=sval[r]*val[p]*sval[l];
	ext[p]=ext[l]|ext[r]|((p<par[p])^(par[p]<par[par[p]]));
	top[p]=(l?top[l]:p);
}

void update(int x){
	if(!x)return;
	val[x].l=dat(1,sr[x]);
	val[x].r=dat(1,sl[x]);
	val[x].all=dat(1,(x%2)+sl[x]+sr[x]);
	if(bo[x])val[x]*=inv2;
//	cout<<"x: "<<x<<"\n";
//	cout<<"val[x].all "<<val[x].all.k.x<<" "<<val[x].all.b.x<<"\n";
	up(x);
//	cout<<"sval[x].all "<<sval[x].all.k.x<<" "<<sval[x].all.b.x<<"\n";
}

void rot(int x){
	int y=fa[x],z=fa[y],k=chk(x),s=ch[x][!k];
	fa[x]=z; if(nrt(y)) ch[z][chk(y)]=x;
	if(s)fa[s]=y; ch[y][k]=s;
	ch[x][!k]=y; fa[y]=x;
	up(y);
}
void splay(int x){
	if(!x)return;
	while(nrt(x)){
		if(nrt(fa[x]))rot(chk(x)==chk(fa[x])?fa[x]:x);
		rot(x); 
	}up(x);
}
void dfs(int x){
	if(ls(x))dfs(ls(x));
	if(rs(x))dfs(rs(x));
	update(x),up(x);
}

int st[maxn],tp;
void make(int x,int y){
//	cout<<"mk "<<x<<" "<<y<<"\n";
    if(rs(x)){
    	if(rs(x)<x) sl[x]+=sval[rs(x)].all.b;
    	else sr[x]+=sval[rs(x)].all.b;
    }
    splay(y);
    if(rs(x)=y){
		if(rs(x)<x) sl[x]-=sval[rs(x)].all.b,assert(sl[x].x==0);
    	else sr[x]-=sval[rs(x)].all.b,assert(sr[x].x==0);
    }
    update(x);
    up(x);
}
void acc(int x){
    tp=0;
  //  cout<<"acc "<<x<<"\n";
    for(int y=0;x;x=fa[y=x]) 
	//	cout<<"x: "<<x<<" "<<fa[x]<<"\n",
		splay(x),st[++tp]=x;
    Rep(i,tp,1){
        splay(st[i]);
        make(st[i],st[i-1]);
    }
  //  cout<<"done\n";
   // cout<<"tp "<<tp<<" "<<st[tp]<<"\n";
}

void cut(int x){
	if(!par[x])return;
//	cout<<"cut "<<x<<" "<<par[x]<<"\n";
	acc(x),splay(x);
	fa[ls(x)]=0,ls(x)=0,up(x);
	if(x<par[x]) ls[par[x]]=0;
	else rs[par[x]]=0;
	par[x]=0;
}
void link(int x,int y){
//	cerr<<"link "<<x<<" "<<y<<"\n";
	if(!x||!y)return;
	if(x<y)ls[y]=x; else rs[y]=x;
	
	par[x]=y;
	acc(x),splay(ls[x]),splay(rs[x]),acc(y),splay(y);
	fa[x]=y;
	
	if(x<y) sl[y]+=sval[x].all.b;
	else sr[y]+=sval[x].all.b;
	
	update(y);
	up(y);
}

vi stk;
void find(int x){
	if(!x||!ext[x])return;
	find(ch[x][1]);
	if((x<par[x])!=(par[x]<par[par[x]]))stk.pb(par[x]);
	find(ch[x][0]);
}

void splay_up(int x)
{
	root=x;
	if(!par[x]){
		splay(x);
		if(!bo[x])bo[x]=1,update(x);
		return;
	}
//	cout<<"splay_up "<<x<<"\n";
	stk.clear();
	acc(x),splay(x),stk.clear(),find(x);
	if(!stk.size() || stk.back()!=top[x]) stk.pb(top[x]);
	
	int lim=stk.size(),z,_q=par[stk[0]];
	For(i,0,lim-1){
		z=par[stk[i]];
		cut(stk[i]);
		if(i>0) link(stk[i-1],z);
	}
	int _p=par[x],di=(rs[_p]==x);
	cut(x);
	if(di)z=ls[x]; else z=rs[x];
	cut(z); link(z,_p);
	if(_q){
		if(di) z=rs[x]; else z=ls[x];
		cut(z); link(z,_q);
	}
	link(stk[lim-1],x);
	if(lim>1) link(stk[lim-2],x);
	if(!bo[x]){
		bo[x]=1;
		update(x);
	}
}

modint brute(int u,int l,int r,bool ou=0){
	if(l==r||(u&1))return 1;
//	cout<<"u,ls[u],rs[u] "<<u<<" "<<ls[u]<<" "<<rs[u]<<"\n";
	if(r<=u)return brute(ls[u],l,r);
	if(l>=u)return brute(rs[u],l,r);
	modint ansl=brute(ls[u],l,u);
	modint ansr=brute(rs[u],u,r);
	modint ans=ansl+ansr;
	if(bo[u]) ans*=inv2,ansl*=inv2,ansr*=inv2;
//	if(ou)cout<<"ansl,ansr "<<ansl.x<<" "<<ansr.x<<"\n";
	return ans;
}

modint query(int l,int r)
{
//	cout<<"query "<<l<<" "<<r<<"\n";
	if(l==r)return 1;
	acc(l);
	acc(r);
//	cout<<"tp "<<tp<<" "<<st[tp]<<"\n";
	int z=st[tp];
//	cout<<"z "<<z<<"\n";
	acc(z);
	splay(l);
	splay(r);
//	dfs(l),dfs(r);
	modint res=sval[l].l.b+sval[r].r.b+sval[l].l.k+sval[r].r.k;
	modint resl=sval[l].l.b+sval[l].l.k;
	modint resr=sval[r].r.b+sval[r].r.k;
	if(bo[z]) res*=inv2,resl*=inv2,resr*=inv2;
//	cout<<"resl,resr "<<resl.x<<" "<<resr.x<<"\n";
//	for(int x=l;x!=z;x=par[x]) update(x),cout<<"xval "<<x<<" "<<val[x].l.k.x<<" "<<val[x].l.b.x<<"   "<<sl[x].x<<" "<<sr[x].x<<"\n";
//	modint qwq=brute(z,l,r,1);
//	cout<<"qwq "<<qwq.x<<"\n";
	return res;
}

signed main()
{
//	freopen("test.in","r",stdin);
//	freopen("my.out","w",stdout);
	n=read(),m=read();
	For(i,1,m){
		qop[i]=read();
		if(qop[i]==1) ql[i]=read(),qr[i]=read();
		else qx[i]=read();
	}
	// n*2-1.
	For(i,1,(n-1)*2-1) update(i);
	int lst=1;
	for(int i=2;i<=(n-2)*2;i+=2){
		link(lst,i);
		link(i+1,i);
		lst=i;
	}
	root=lst;
	Rep(i,m,1){
	//	cout<<"i: "<<i<<"\n";
		if(qop[i]==2){
			if(qx[i]!=1&&qx[i]!=n)splay_up((qx[i]-1)*2);
		}else{
			--qr[i];
			modint ans=query(ql[i]*2-1,qr[i]*2-1);
	//		modint ans2=brute(root,ql[i]*2-1,qr[i]*2-1);
	//		cout<<ans.x<<"\n";
	//		cout<<ans2.x<<"\n";
			res+=ans;
		}
	}
	cout<<res.x;
	return 0;
}
/*
20 20
1 4 10
2 13
2 2
2 11
2 6
1 9 15
1 6 15
1 5 12
2 11
1 10 12
2 11
1 9 13
2 14
1 1 5
2 5
2 19
1 14 18
2 7
1 1 16
2 11


20 9
1 4 10
2 13
2 2
2 11
2 6
1 9 15
1 6 15
1 5 12
2 11

20 5
1 4 10
2 13
2 2
2 11
2 6

4 5
1 1 4
1 2 3
2 3
1 1 4
2 2
*/