#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <ctime>
#include <vector>
#include <queue>
#include <map>
#include <stack>
#include <set>
#include <bitset>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define ms(a, b) memset(a, b, sizeof(a))
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define eps 0.0000000001
#define IOS ios::sync_with_stdio(0);cin.tie(0);
#define random(a, b) rand()*rand()%(b-a+1)+a
#define pi acos(-1)
const ll INF = 0x3f3f3f3f3f3f3f3fll;
const int inf = 0x3f3f3f3f;
const int maxn = 200000 + 100;
const int maxm = 200000 + 10;
const int mod = 998244353;
ll fac[maxn],inv[maxn];
ll qpow(ll a,ll b){ll res=1;while(b){if(b&1) res=res*a%mod;b>>=1;a=a*a%mod;}return res;
}
void init(){fac[0]=1;for(int i=1;i<maxn;i++) fac[i]=fac[i-1]*i%mod;inv[maxn-1]=qpow(fac[maxn-1],mod-2);for(int i=maxn-2;i>=0;i--) inv[i]=inv[i+1]*(i+1)%mod;
}
ll C(int n,int m){if(m>n||m<0) return 0;return fac[n]*inv[m]%mod*inv[n-m]%mod;
}
struct ND{int x,pos,w;
}a[maxn];
int cnt;
ll cal(int x,int y){ll res=0;for(int i=1;i<=cnt;i++){if(a[i].x<=x&&a[i].pos<=y){res=(res+C(x-a[i].x+y-a[i].pos-1,x-a[i].x-1)*a[i].w%mod+mod)%mod;}}return res;
}
int main() {
#ifdef LOCALfreopen("in.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
#endifinit();int T;int n,m,op,x,y;scanf("%d",&T);while(T--){scanf("%d%d",&n,&m);int now=1;cnt=0;while(m--){scanf("%d",&op);if(op==1){scanf("%d%d%d",&x,&y,&op);a[++cnt].x=now-1,a[cnt].pos=x,a[cnt].w=op;a[++cnt].x=now-1,a[cnt].pos=y+1,a[cnt].w=-op;}else if(op==2){now++;}else{scanf("%d%d",&x,&y);ll ans=(cal(now+1,y)-cal(now+1,x-1)+mod)%mod;printf("%lld\n",ans);}}}return 0;
}