#include using namespace std; typedef signed long long ll; #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define FORR2(x,y,arr) for(auto& [x,y]:arr) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) template bool chmax(T &a, const T &b) { if(a bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;} //------------------------------------------------------- int N,M,Q; int P[202020],S[202020]; int L[202020],R[202020],ac[202020],wa[202020]; deque AC[202020]; vector> ev[202020]; const int DI=900; ll nac=0,nwa=0; void add1(int pos) { int p=P[pos]; if(S[pos]==0) { AC[p].back()++; } else { if(AC[p].size()==1) { nac++; nwa+=AC[p][0]; } AC[p].push_back(0); } } void add2(int pos) { int p=P[pos]; if(S[pos]==0) { AC[p][0]++; if(AC[p].size()>=2) nwa++; } else { if(AC[p].size()==1) { nac++; } else { nwa-=AC[p][0]; } AC[p].push_front(0); } } void del(int pos) { int p=P[pos]; if(S[pos]==0) { AC[p][0]--; if(AC[p].size()>1) nwa--; } else { AC[p].pop_front(); if(AC[p].size()==1) { nac--; } else { nwa+=AC[p][0]; } } } void solve() { int i,j,k,l,r,x,y; string s; cin>>N>>M>>Q; FOR(i,N) { cin>>P[i]>>s; S[i]=s=="AC"; } FOR(i,Q) { cin>>L[i]>>R[i]; L[i]--; ev[L[i]/DI].push_back({R[i],i}); } FOR(i,M+1) { AC[i].push_back(0); } FOR(i,201000) if(ev[i].size()) { sort(ALL(ev[i])); int CL=i*DI,CR=i*DI; FORR2(r,cur,ev[i]) { int TL=L[cur],TR=r; while(CR