数据结构

// luogu-judger-enable-o2
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<queue>
#include<cstring>
#define rep(i,a,n) for(int i = a;i <= n;i++)
#define per(i,n,a) for(int i = n;i >= a;i--)
#define enter putchar(‘\n‘)
#define pr pair<int,int>
#define mp make_pair
#define fi first
#define sc second
using namespace std;
typedef long long ll;
const int M = 100005;
const int N = 10000005;
 
ll read()
{
    ll ans = 0,op = 1;
    char ch = getchar();
    while(ch < ‘0‘ || ch > ‘9‘)
    {
    if(ch == ‘-‘) op = -1;
    ch = getchar();
    }
    while(ch >=‘0‘ && ch <= ‘9‘)
    {
    ans *= 10;
    ans += ch - ‘0‘;
    ch = getchar();
    }
    return ans * op;
}

ll n,opt,mod,minx,maxx,l,r,x,y,fin,a[M],b[M],cur,sum[M],tot;
char s[5];

ll cal(ll x,ll p)
{
    return x * p % mod;
}

int main()
{
    n = read(),opt = read(),mod = read(),minx = read(),maxx = read();
    rep(i,1,opt)
    {
    scanf("%s",s);
    if(s[0] == ‘A‘) l = read(),r = read(),x = read(),b[l] += x,b[r+1] -= x;
    else
    {
        l = read(),r = read();
        cur = 0,tot = 0;
        rep(j,1,r)
        {
        cur += b[j];
        if(j < l) continue;
        ll g = cal(cur,j);
        if(g >= minx && g <= maxx) tot++;
        }
        printf("%lld\n",tot);
    }
    }
    rep(i,1,n)
    {
    b[i] += b[i-1];
    ll g = cal(b[i],i);
    if(g >= minx && g <= maxx) sum[i] = sum[i-1] + 1;
    else sum[i] = sum[i-1];
    }
    fin = read();
    rep(i,1,fin) x = read(),y = read(),printf("%lld\n",sum[y] - sum[x-1]);
    return 0;
}