#include<cstdio>
namespace IO{
	const int ARR_SIZE=1<<20;
	#define gc() ((IO::si!=IO::ti||(IO::ti=(IO::si=IO::input)+fread(IO::input,1,IO::ARR_SIZE,stdin))),IO::si!=IO::ti?*(IO::si++):EOF)
	#define pc(ch) ((IO::o.so!=IO::o.to||(fwrite(IO::o.output,1,IO::ARR_SIZE,stdout),IO::o.so=IO::o.output)),*(IO::o.so++)=ch)
	char input[ARR_SIZE],*si=input,*ti=input;
	struct Output_Stream{
		char output[ARR_SIZE],*so=output,*to=output+ARR_SIZE;
		~Output_Stream(){
			if(so==output)return;
			fwrite(output,1,so-output,stdout);
			so=output;
		}
	}o;
	template<typename T>
	void read(T&num){
		int ch=gc();
		num=0;
		while(ch<48||ch>57)ch=gc();
		while(ch>=48&&ch<=57)num=(num<<3)+(num<<1)+(ch^48),ch=gc();
	}
	template<typename T>
	void write(T a){
		static int ch[50],cnt=0;
		if(a==0)pc('0');
		while(a)ch[++cnt]=a%10|48,a/=10;
		while(cnt)pc(ch[cnt--]);
	}
}
using IO::read;
using IO::write;
typedef long long ll;
const int maxn=100000,maxlog2n=16,maxm=100000,maxnode1=maxn*(maxlog2n+2)*(maxlog2n+2)*2,maxnode2=(maxn+1)*4+1,P=998244353;
inline int qmod(const int x){
	return x+((x>>31)&P);
}
inline int merge(const int x,const int y){
	return((ll)x*y+(ll)qmod(1-x)*qmod(1-y))%P;
}
int n,m,inv[maxn+1];
struct Node{
	int l,r,v;
}T1[maxnode1+1];
int tot1;
int T2[maxnode2+1];
int lx,rx,ly,ry,val;
void change_y(int&u,const int l,const int r){
	if(!u){
		u=++tot1;
		T1[u].v=1;
	}
	if(ly<=l&&r<=ry){
		T1[u].v=merge(T1[u].v,val);
		return;
	}
	const int mid=(l+r)>>1;
	if(ly<=mid)change_y(T1[u].l,l,mid);
	if(ry>mid)change_y(T1[u].r,mid+1,r);
}
void change_x(const int u,const int l,const int r){
	if(lx<=l&&r<=rx){
		change_y(T2[u],1,n);
		return;
	}
	const int mid=(l+r)>>1;
	if(lx<=mid)change_x(u<<1,l,mid);
	if(rx>mid)change_x(u<<1|1,mid+1,r);
}
void change_x(const int lx,const int rx,const int ly,const int ry,const int val){
	::lx=lx,::rx=rx,::ly=ly,::ry=ry,::val=val;
	change_x(1,0,n);
}
int pos_x,pos_y;
int ask_y(const int u,const int l,const int r){
	if(!u)return 1;
	if(l==r)return T1[u].v;
	const int mid=(l+r)>>1;
	if(pos_y<=mid)return merge(T1[u].v,ask_y(T1[u].l,l,mid));
	return merge(T1[u].v,ask_y(T1[u].r,mid+1,r));
}
int ask_x(const int u,const int l,const int r){
	if(l==r)return ask_y(T2[u],1,n);
	const int mid=(l+r)>>1;
	if(pos_x<=mid)return merge(ask_y(T2[u],1,n),ask_x(u<<1,l,mid));
	return merge(ask_y(T2[u],1,n),ask_x(u<<1|1,mid+1,r));
}
int ask_x(const int pos_x,const int pos_y){
	::pos_x=pos_x,::pos_y=pos_y;
	return ask_x(1,0,n);
}
int main(){
	read(n),read(m);
	inv[1]=1;
	for(int i=2;i<=n;i++)inv[i]=ll(P-P/i)*inv[P%i]%P;
	for(int i=1,opt,l,r,p,q;i<=m;i++){
		read(opt),read(l),read(r);
		if(opt==1){
			p=inv[r-l+1],q=qmod(1-p);
			if(l>1)change_x(1,l-1,l,r,q),change_x(0,0,1,l-1,0);
			if(r<n)change_x(l,r,r+1,n,q),change_x(0,0,r+1,n,0);
			change_x(l,r,l,r,qmod(q-p)),change_x(0,0,l,r,p);
		}else write(ask_x(l-1,r)),pc('\n');
	}
	return 0;
}