#include <bits/stdc++.h>
using namespace std;
struct binary_indexed_tree{
  int N;
  vector<int> BIT;
  binary_indexed_tree(int N): N(N), BIT(N + 1, 0){
  }
  void add(int i, int x){
    i++;
    while (i <= N){
      BIT[i] += x;
      i += i & -i;
    }
  }
  int sum(int i){
    int ans = 0;
    while (i > 0){
      ans += BIT[i];
      i -= i & -i;
    }
    return ans;
  }
};
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];
    p[i]--;
  }
  vector<int> L(N), R(N);
  for (int i = 0; i < N; i++){
    cin >> L[i] >> R[i];
    L[i]--;
  }
  vector<vector<int>> ac(M);
  for (int i = 0; i < N; i++){
    if (S[i] == "AC"){
      ac[p[i]].push_back(i);
    }
  }
  vector<vector<pair<int, int>>> add1(N + 1);
  vector<vector<pair<int, int>>> add2(N + 1);
  for (int i = 0; i < N; i++){
    auto itr = lower_bound(ac[p[i]].begin(), ac[p[i]].end(), i);
    if (S[i] == "AC"){
      int l = -1;
      if (itr != ac[p[i]].begin()){
        l = *(itr - 1);
      }
      add1[l + 1].push_back(make_pair(i, 1));
      add1[i].push_back(make_pair(i, -1));
    }
    if (S[i] == "WA"){
      if (itr != ac[p[i]].end()){
        int r = *itr;
        int l = -1;
        if (itr != ac[p[i]].begin()){
          l = *(itr - 1);
        }
        add2[l + 1].push_back(make_pair(r, 1));
        add2[i].push_back(make_pair(r, -1));
      }
    }
  }
  vector<vector<pair<int, int>>> get(N + 1);
  for (int i = 0; i < Q; i++){
    get[L[i]].push_back(make_pair(R[i], i));
  }
  vector<int> ans1(Q), ans2(Q);
  binary_indexed_tree BIT1(N);
  binary_indexed_tree BIT2(N);
  for (int i = 0; i < Q; i++){
    int cnt1 = get[i].size();
    for (int j = 0; j < cnt1; j++){
      int r = get[i][j].first;
      int id = get[i][j].second;
      ans1[id] = BIT1.sum(r);
      ans2[id] = BIT2.sum(r);
    }
    int cnt2 = add1[i].size();
    for (int j = 0; j < cnt2; j++){
      int p = add1[i][j].first;
      int x = add1[i][j].second;
      BIT1.add(p, x);
    }
    int cnt3 = add2[i].size();
    for (int j = 0; j < cnt3; j++){
      int p = add2[i][j].first;
      int x = add2[i][j].second;
      BIT2.add(p, x);
    }
  }
  for (int i = 0; i < Q; i++){
    cout << ans1[i] << ' ' << ans2[i] << endl;
  }
}