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

const int mx = 2e5+10;
int nnn[mx],now[mx],l[mx],r[mx],ccc[mx],cnc[mx],nxt[mx];
int p[mx];
int n,m,q;
const int B = 600;
char s[mx];

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin>>n>>m>>q;
    for(int i = 0;i<n;i++){
        cin>>p[i];
        string a;
        cin>>a;
        if(a=="AC") s[i] = 1;
    }
    int mx = 2e5;
    const int B = 2;
    vector<vector<int>> is(mx+1);
    for(int i = 0;i<n;i++){
        is[p[i]].push_back(i);
    }
    for(int i = 0;i<=mx;i++){
        int now = 0;
        int ni = -1;
        if(is[i].size()==0) continue;
        for(int j = is[i].size()-1;j>=0;j--){
            if(s[is[i][j]]){
                cnc[is[i][j]] = now;
                nxt[is[i][j]] = ni;
                now= 0;
                ni = is[i][j];
            }else{
                now++;
            }
        }
    }
    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]/B) 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]){
        ans++;
        nnn[p[0]]++;
        now[p[0]]++;
    }else{
        now[p[0]]++;
    }
    for(int i = 0;i<q;i++){
        int ni = idx[i];
        while(l[ni]<nl){
            nl--;
            if(s[nl]){
                cnt -= ccc[p[nl]];
                ccc[p[nl]]=0;
                nnn[p[nl]]++;
                if(nnn[p[nl]]==1) ans++;
                now[p[nl]]++;
            }else{
                if(nnn[p[nl]]){
                    cnt++;
                    ccc[p[nl]]++;
                }
                now[p[nl]]++;
            }
        }
        while(nr<r[ni]){
            if(s[nr]){
                if(nnn[p[nr]]==0){
                    ans++;
                    ccc[p[nr]] += now[p[nr]];
                    cnt += ccc[p[nr]];
                }
                nnn[p[nr]]++;
                now[p[nr]]++;
                nr++;
            }else{
                now[p[nr]]++;
                nr++;
            }
        }
        while(nl<l[ni]){
            if(s[nl]){
                nnn[p[nl]]--;
                now[p[nl]]--;
                if(nnn[p[nl]]){
                    int ni = cnc[nl];
                    cnt += ccc[p[nl]] += ni;
                }else{
                    ans--;
                }
                nl++;
            }else{
                now[p[nl]]--;
                if(nnn[p[nl]]){
                    ccc[p[nl]]--;
                    cnt--;
                }
                nl++;
            }
        }
        while(nr>r[ni]){
            nr--;
            if(s[nr]){
            now[p[nr]]--;
                nnn[p[nr]]--;
                if(nnn[p[nr]]==0){
                    cnt -= ccc[p[nr]];
                    ccc[p[nr]] = 0;
                    ans--;
                }
            }else{
                now[p[nr]]--;
            }
        }
        aa[ni] = make_pair(ans,cnt);
    }
    for(int i = 0;i<q;i++) cout<<aa[i].first<<" "<<aa[i].second<<endl;
}