#include<bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
    int n,m,q;
    cin>>n>>m>>q;
    vector<int> p(n);
    vector<string> s(n);
    for(int i = 0;i<n;i++){
        cin>>p[i]>>s[i];
    }
    int mx = 2e5;
    const int B = 1800;
    vector<set<int>> nnn(mx+1);
    vector<deque<int>> now(mx+1);
    vector<int> l(q),r(q);
    vector<int> ccc(mx+1,0);
    for(int i = 0;i<q;i++){
        cin>>l[i]>>r[i];
        l[i]--;
    }
    vector<int> idx(q);
    for(int i = 0;i<q;i++) idx[i] = i;
    sort(idx.begin(),idx.end(),[&](int i,int j){
        if(l[i]/B!=l[j]/n) return l[i] < l[j];
        if(l[i]/B%2) return r[i] > r[j];
        return r[i] < r[j];
    });

    int ans = 0;
    int cnt = 0;
    int nl = 0;
    int nr = 1;
    vector<pair<int,int>> aa(q);

    if(s[0]=="AC"){
        ans++;
        nnn[p[0]].insert(0);
        now[p[0]].push_front(0);
    }else{
        now[p[0]].push_back(0);
    }

    for(int i = 0;i<q;i++){
        int ni = idx[i];
        
        while(l[ni]<nl){
            nl--;
            if(s[nl]=="AC"){
                cnt -= ccc[p[nl]];
                ccc[p[nl]]=0;
                nnn[p[nl]].insert(nl);
                if(nnn[p[nl]].size()==1) ans++;
                now[p[nl]].push_front(nl);
            }else{
                if(nnn[p[nl]].size()){
                    cnt++;
                    ccc[p[nl]]++;
                }
                now[p[nl]].push_front(nl);
            }
        }
        while(nr<r[ni]){
            if(s[nr]=="AC"){
                if(nnn[p[nr]].size()==0){
                    ans++;
                    ccc[p[nr]] += now[p[nr]].size();
                    cnt += ccc[p[nr]];
                }
                nnn[p[nr]].insert(nr);
                now[p[nr]].push_back(nr);
                nr++;
            }else{
                now[p[nr]].push_back(nr);
                nr++;
            }
        }
        while(nl<l[ni]){
            if(s[nl]=="AC"){
                nnn[p[nl]].erase(nl);
                now[p[nl]].pop_front();
                if(nnn[p[nl]].size()){
                    int ii = *nnn[p[nl]].begin();
                    int ni = lower_bound(now[p[nl]].begin(),now[p[nl]].end(),ii) - now[p[nl]].begin();
                    cnt += ccc[p[nl]] += ni;
                }else{
                    ans--;
                }
                nl++;
            }else{
                now[p[nl]].pop_front();
                if(nnn[p[nl]].size()){
                    ccc[p[nl]]--;
                    cnt--;
                }
                nl++;
            }
        }
        while(nr>r[ni]){
            nr--;
            if(s[nr]=="AC"){
                now[p[nr]].pop_back();
                nnn[p[nr]].erase(nr);
                if(nnn[p[nr]].size()==0){
                    cnt -= ccc[p[nr]];
                    ccc[p[nr]] = 0;
                    ans--;
                }
            }else{
                now[p[nr]].pop_back();
            }
        }
        aa[ni] = make_pair(ans,cnt);
        //cout<<i<<" "<<nl<<" "<<nr<<" "<<ans<<" "<<cnt<<endl;
        //cout<<nnn[2].size()<<endl;
    }

    for(int i = 0;i<q;i++) cout<<aa[i].first<<" "<<aa[i].second<<endl;

}