// 私は猫です

#include<bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
#define inf 1000000000
#define infll 1000000000000000000ll
#define pii pair<int,int>
#define rep(i,a,b,c) for(int i=(a);i<=(b);i+=(c))
#define per(i,a,b,c) for(int i=(a);i>=(b);i-=(c))
#define F(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define dF(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define cmh(sjy) while(sjy--)
#define lowbit(x) ((x)&(-(x)))
#define HH printf("\n")
#define eb emplace_back
#define poly vector<int>
#define SZ(x) ((int)x.size())
using namespace std;
template<typename T>inline void chkmax(T &x,const T &y){ x=std::max(x,y); }
template<typename T>inline void chkmin(T &x,const T &y){ x=std::min(x,y); }
const int mod=998244353,maxn=50005,I=(mod+1)>>1,B=2500;
inline void inc(int &x,const int y){ x=(x+y>=mod)?(x+y-mod):(x+y); }
inline int add(const int x,const int y){ return (x+y>=mod)?(x+y-mod):(x+y); }
int n,zsy,op[maxn],tx[maxn],ty[maxn];
namespace seg{
	int t[maxn<<2],len,k;
	inline void init(int n){
		for(len=1,k=0;len<n;len<<=1,++k);
		F(i,1,(len<<1)-1)t[i]=inf;
	}
	inline void update(int u,int val){
		t[u+=len-1]=val;
		F(i,1,k){ const int v=u>>i; t[v]=min(t[v<<1],t[v<<1|1]); }
	}
	inline int query(int l,int r){
		int res=inf;
		for(l+=len-1,r+=len;l<r;l>>=1,r>>=1){
			if(l&1)chkmin(res,t[l++]);
			if(r&1)chkmin(res,t[--r]);
		} return res;
	}
}
int cur,lst,res[maxn][B+5],tim[maxn][B+5];
int Solve(int l,int r){
	if(r-l<=1)return r-l;
	if(r-l<B){
		if(tim[l][r-l]<=lst)return res[l][r-l];
		tim[l][r-l]=cur;
		const int t=seg::query(l+1,r-1);
		if(t>zsy)return res[l][r-l]=r-l;
		return res[l][r-l]=1ll*I*add(Solve(l,tx[t]),Solve(tx[t],r))%mod;
	}
	const int t=seg::query(l+1,r-1);
	if(t>zsy)return r-l;
	return 1ll*I*add(Solve(l,tx[t]),Solve(tx[t],r))%mod;
}
void solve(){
	cin>>n>>zsy,lst=zsy+1;
	F(i,1,zsy){ cin>>op[i]>>tx[i]; if(op[i]==1)cin>>ty[i]; }
	memset(tim,0x3f,sizeof tim),seg::init(n); int ans=0;
	dF(i,zsy,1){
		cur=i;
		if(op[i]==1)inc(ans,Solve(tx[i],ty[i]));
		else seg::update(tx[i],i),lst=i;
	} cout<<ans;
}
signed main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int zsy=1;
	F(____,1,zsy)solve();
}