#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m, q; cin >> n >> m >> q;
	vector<pair<int, string>>sub(n);
	rep(i, n) {
		cin >> sub[i].first >> sub[i].second;
		sub[i].first--;
	}
	vector<vector<int>>eve(n);
	vector<int>l(q), r(q);
	rep(i, q) {
		cin >> l[i] >> r[i];
		l[i]--;
		eve[l[i]].push_back(i);
	}
	vector<P>ans(q);
	vector<int>actime(m, n);
	fenwick_tree<int> ac(n + 1), wa(n + 1);
	rrep(i, n) {
		int x = sub[i].first;
		int t = actime[x];
		if ("AC" == sub[i].second) {
			ac.add(t, -1);
			wa.add(t, -wa.sum(t, t + 1));
			ac.add(i, 1);
			actime[x] = i;
		}
		else {
			wa.add(t, 1);
		}
		for (auto idx : eve[i]) {
			ans[idx] = { ac.sum(l[idx],r[idx]),wa.sum(l[idx],r[idx]) };
		}
	}
	rep(i, q)cout << ans[i].first << " " << ans[i].second << endl;
	return 0;
}