#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=998244353;
ll fac[310000],inv[310000];
ll C(int n,int m)
{
    ll res=fac[n]*inv[m]%mod*inv[n-m]%mod;
    return res;
}
struct node
{
    int l,r,w,id;
}a[210000];
int now;
int n,m,nn;
ll cc(int x,ll w,int id,int y)
{
    if (x>y) return 0;
    return w*C(id+1+y-x,y-x)%mod;
}
ll cal(int x)
{
    ll res=0;
    for (int i=1;i<=nn;i++)
    if (a[i].l<=x){
        int tmp=now-a[i].id;
        ll par1 = cc(a[i].l,a[i].w,tmp,x)-cc(a[i].r+1, a[i].w,tmp,x);
        while(par1<0) par1 += mod;
        res=(res+par1+mod)%mod;
    }
    return res;
}
int main()
{
    fac[0]=1;
    for (int i=1;i<=210010;i++)
        fac[i]=(fac[i-1]*i)%mod;
    inv[1]=inv[0]=1;
    for (int i=2;i<=210010;i++)
    {
        inv[i]=(ll)(mod-mod/i)*inv[mod%i]%mod;
    }
    for (int i=2;i<=210010;i++)
        inv[i]=(inv[i-1]*inv[i])%mod;
    int T;
    scanf("%d",&T);
    while (T--)
    {
        scanf("%d %d",&n,&m);
        now=nn=0;
        while (m--)
        {
            int op;
            scanf("%d",&op);
            if (op==1)
            {
                int l,r,w;
                scanf("%d %d %d",&l,&r,&w);
                a[++nn]={l,r,w,now};
            }
            else if (op==2) now++;
            else
            {
                int l,r;
                scanf("%d %d",&l,&r);
                ll ans=(cal(r)-cal(l-1)+mod)%mod;
                printf("%lld\n",ans);
            }
        }
    }
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
const int maxn = 1e5+10;
typedef long long ll;
ll fac[maxn], inv[maxn];
int n, m, k, x, y;
int nn;
void init(){
    fac[0]=1;
    for (int i=1;i<maxn;i++)
        fac[i]=(fac[i-1]*i)%mod;
    inv[1]=inv[0]=1;
    for (int i=2;i<maxn;i++)
    {
        inv[i]=(ll)(mod-mod/i)*inv[mod%i]%mod;
    }
    for (int i=2;i<maxn;i++)
        inv[i]=(inv[i-1]*inv[i])%mod;
}
struct Node{
    int x, id;
    bool operator < (Node b)const{
        return x<b.x;
    }
}node[maxn];
ll pow_mod(ll a, ll b){
    ll ans = 1;
    while(b){
        if(b&1) ans = ans*a%mod;
        b>>1;
        a = a*a%mod;
    }
    return ans;
}
ll C(int n, int m){
    return fac[n]*inv[m]%mod*inv[n-m]%mod;
}
ll cc(int x, int y, ll w){
    if(x>y) return false;
    //cout<<"test"<<y-x+k-1<<" "<<w<<endl;
    return C(y-x+k-1, y-x)*w%mod;
}
multiset<Node>::iterator it;
multiset<Node> s;
ll query(int x){
    ll ans = 0;
    for(it=s.begin(); it!=s.end(); it++){
        //cout<<"huhu"<<(*it).x<<endl;
        if((*it).x>x) break;
        else{
            ans += cc((*it).x, x, (ll)(*it).id);
            ans = ans%mod;
        }
    }
    return ans;
}
int main()
{
    init();
    while(~scanf("%d%d%d", &n, &m, &k)){
        int op;
        s.clear();
        nn = 0;
        for(int i=0; i<m; i++){
            scanf("%d", &op);
            if(op == 0){
                scanf("%d%d", &x, &y);
                s.insert(Node{x, y});
            }
            else if(op == 1){
                scanf("%d", &x);
                printf("%lld\n", query(x));
            }
        }
    }
    return 0;
}