#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m, q;
  cin >> n >> m >> q;
  vector<pair<int, string>> ps(n);
  for(auto& [p, s] : ps) cin >> p >> s, p--;
  VI ac_time(m, n);
  fenwick_tree<int> ac(n + 1), wa(n + 1);
  vector<P> lr(q);
  VVI ev(n);
  rep(i, q) {
    auto& [l, r] = lr[i];
    cin >> l >> r;
    l--;
    ev[l].emplace_back(i);
  }
  vector<P> ans(q);
  rrep(i, n) {
    int x = ps[i].first;
    int t = ac_time[x];
    if (ps[i].second == "AC") {
      ac.add(t, -1);
      wa.add(t, -wa.sum(t, t + 1));
      ac.add(i, 1);
      ac_time[x] = i;
    } else {
      wa.add(t, 1);
    }
    for(int iq : ev[i]) {
      auto [l, r] = lr[iq];
      ans[iq] = {ac.sum(l, r), wa.sum(l, r)};
    }
  }
  for(auto [a, w] : ans) cout << a << ' ' << w << '\n';
}