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

typedef long long ll;

struct t3{int left, right, index;};
bool sec_sort(t3 a, t3 b){return a.right < b.right;}

int main(){
	int n, m, q;
	cin >> n >> m >> q;
	
	vector<int> prob(n);
	vector<int> dat(n);
	vector<int> lftwa(m);
	vector<int> nowcnt(m);

	for (int i=0; i<n; i++){
		int p; string s; cin >> p >> s;
		p--;
		prob[i] = p;
		if (s == "AC"){
			dat[i] = 1;
			lftwa[i] = nowcnt[p];
		}else{
			dat[i] = 0;
			nowcnt[p]++;
		}
	}

	int sep = ceil(sqrt(n));
	vector<vector<t3>> mo(sep+1, vector<t3>(0));
	t3 f;

	for(int i=0; i<q; i++){
		int l, r;
		cin >> l >> r;
		l--;
		f.left = l;
		f.right = r;
		f.index = i;
		mo[l/sep].push_back(f);
	}

	vector<int> ans1(q); // AC
	vector<int> ans2(q); // WA

	vector<deque<int>> ac;
	ac.resize(m);
	vector<int> lftsum(m);

	int l = 0, r = 0;
	int tl, tr;
	int nowans1 = 0;
	int nowans2 = 0;

	for(int i=0; i<sep+1; i++){
		sort(mo[i].begin(), mo[i].end(), sec_sort);
		for(int j=0; j<mo[i].size(); j++){
			tl = mo[i][j].left;
			tr = mo[i][j].right;
			//右を伸ばす
			for(int k=r; k<tr; k++){
				if (dat[k] == 1){
					if (ac[prob[k]].empty()){
						nowans1++;
						nowans2 += lftwa[k] - lftsum[prob[k]];
					}
					ac[prob[k]].push_back(k);
				}
			}
			//右を縮ませる
			for(int k=r-1; k>=tr; k--){
				if (dat[k] == 1){
					ac[prob[k]].pop_back();
					if (ac[prob[k]].empty()){
						nowans2 -= lftwa[ac[prob[k]].front()] - lftsum[prob[k]];
						nowans1--;
					}
				}
			}
			//左を縮ませる
			for(int k=l; k<tl; k++){
				if (dat[k] == 1){
					ac[prob[k]].pop_front();				
					if (!ac[prob[k]].empty()){
						nowans2 += lftwa[k] - lftsum[prob[k]];
					}else{
						nowans1--;
					}
				}else{
					lftsum[prob[k]]++;
					if (!ac[prob[k]].empty()) nowans2--;
				}
			}
			//左を伸ばす
			for(int k=l-1; k>=tl; k--){
				if (dat[k] == 1){
					if (!ac[prob[k]].empty()){
						nowans2 -= lftwa[ac[prob[k]].front()] - lftsum[prob[k]];
					}else{
						nowans1++;
					}
					ac[prob[k]].push_front(k);
				}else{
					lftsum[prob[k]]--;
					if (!ac[prob[k]].empty()) nowans2++;
				}
			}
			l = tl; r = tr;
			ans1[mo[i][j].index] = nowans1;
			ans2[mo[i][j].index] = nowans2;
		}
	}
	
	for(int i=0; i<q; i++){
		cout << ans1[i] << " " << ans2[i] << "\n";
	}
}