疯狂RE？？求解？？

#include<iostream>
#include<cstdio>
#include<algorithm>
#define int long long
using namespace std;
int read()
{
    int x=0,f=1;char c=getchar();
    while(!isdigit(c))
    {
        if(c=='-') f*=-1;
        c=getchar();
    }
    while(isdigit(c))
    {
        x=x*10+(c^48);
        c=getchar();
    }
    return x*f;
}
int sum[200002],a[200002],ans[200002];
signed main()
{
    int n=read(),opt=read(),mod=read(),minn=read(),maxn=read();
    for(int i=1;i<=opt;i++)
    {
        char c=getchar();
    //	while(c!='Q'||c!='A') c=getchar();
        if(c=='A')
        {
            int l=read(),r=read(),x=read();
            a[l]+=x,a[r+1]-=x;
        }
        if(c=='Q')
        {
            int l=read(),r=read();
            for(int i=1;i<=r;i++) sum[i]=sum[i-1]+a[i];
            for(int i=1;i<=r;i++)
            {
                if((sum[i]%mod*i%mod>=minn)&&(sum[i]%mod*i%mod<=maxn))
                    ans[i]=ans[i-1]+1;
                else ans[i]=ans[i-1];
            }
            printf("%lld\n",(ans[r]-ans[l-1])%mod);
        }
    }
    for(int i=1;i<=n;i++) sum[i]=sum[i-1]+a[i];
    for(int i=1;i<=n;i++)
    {
        if(sum[i]%mod*i%mod>=minn&&sum[i]%mod*i%mod<=maxn)
            ans[i]=ans[i-1]+1;
        else ans[i]=ans[i-1];
    }
    int fin=read();
    for(int i=1;i<=fin;i++)
    {
        int l=read(),r=read();
        printf("%lld\n",(ans[r]-ans[l-1])%mod);
    }
}