#include<bits/stdc++.h>
#define MAXN 100005
using namespace std;
const int MOD=998244353;
int N,M,cnt;
int merge(int p1,int p2){return (1ll*p1*p2+1ll*(1-p1+MOD)*(1-p2+MOD))%MOD;
}
struct SGT2{int size;int ls[MAXN*200],rs[MAXN*200],p[MAXN*200];void Modify(int &u,int l,int r,int yl,int yr,int prob){if(!u) u=++size,p[u]=1;if(yl<=l&&r<=yr) return (void)(p[u]=merge(p[u],prob));int mid=(l+r)>>1;if(yl<=mid) Modify(ls[u],l,mid,yl,yr,prob);if(mid<yr) Modify(rs[u],mid+1,r,yl,yr,prob);}int Query(int u,int l,int r,int py){if(!u) return 1;int ret=merge(1,p[u]);if(l==r) return ret;int mid=(l+r)>>1;if(py<=mid) ret=merge(ret,Query(ls[u],l,mid,py));else ret=merge(ret,Query(rs[u],mid+1,r,py));return ret;}
}DTy;
struct SGT1{int size,root;int ls[MAXN*2],rs[MAXN*2],yroot[MAXN*2];void Modify(int &u,int l,int r,int xl,int xr,int yl,int yr,int prob){if(!u) u=++size;if(xl<=l&&r<=xr) return DTy.Modify(yroot[u],0,N+1,yl,yr,prob);int mid=(l+r)>>1;if(xl<=mid) Modify(ls[u],l,mid,xl,xr,yl,yr,prob);if(mid<xr) Modify(rs[u],mid+1,r,xl,xr,yl,yr,prob);}int Query(int u,int l,int r,int px,int py){if(!u) return 1;int ret=merge(1,DTy.Query(yroot[u],0,N+1,py));if(l==r) return ret;int mid=(l+r)>>1;if(px<=mid) ret=merge(ret,Query(ls[u],l,mid,px,py));else ret=merge(ret,Query(rs[u],mid+1,r,px,py));return ret;}
}DTx;
int fastpow(int a,int b){int ret=1;for(;b;a=1ll*a*a%MOD,b>>=1)if(b&1) ret=1ll*ret*a%MOD;return ret;
}
int main(){//cout<<fastpow(3,MOD-2)<<endl;scanf("%d%d",&N,&M);int t,l,r,prob,ans;for(int i=1;i<=M;i++){scanf("%d%d%d",&t,&l,&r);if(t==1){cnt++;prob=fastpow(r-l+1,MOD-2);DTx.Modify(DTx.root,0,N+1,0,l-1,l,r,(1ll-prob+MOD)%MOD);DTx.Modify(DTx.root,0,N+1,l,r,r+1,N+1,(1ll-prob+MOD)%MOD);if(r-l+1>=2) DTx.Modify(DTx.root,0,N+1,l,r,l,r,(1ll-2ll*prob+2ll*MOD)%MOD);}else{l--;ans=DTx.Query(DTx.root,0,N+1,l,r);if(l==0){if((cnt&1)==0) printf("%d\n",ans);else printf("%d\n",(1-ans+MOD)%MOD);}else printf("%d\n",ans);}}return 0;
}