#include <stdio.h>

typedef struct {
	int key, id;
} data;

typedef struct {
	data obj[200001];
	int size;
} min_heap;

void push(min_heap* h, data x)
{
	int i = ++(h->size), j = i >> 1;
	data tmp;
	h->obj[i] = x;
	while (j > 0) {
		if (h->obj[i].key < h->obj[j].key) {
			tmp = h->obj[j];
			h->obj[j] = h->obj[i];
			h->obj[i] = tmp;
			i = j;
			j >>= 1;
		} else break;
	}
}

data pop(min_heap* h)
{
	int i = 1, j = 2;
	data output = h->obj[1], tmp;
	h->obj[1] = h->obj[(h->size)--];
	while (j <= h->size) {
		if (j < h->size && h->obj[j^1].key < h->obj[j].key) j ^= 1;
		if (h->obj[j].key < h->obj[i].key) {
			tmp = h->obj[j];
			h->obj[j] = h->obj[i];
			h->obj[i] = tmp;
			i = j;
			j <<= 1;
		} else break;
	}
	return output;
}

const int THR = 400;

int main()
{
	int i, N, M, Q, P[200001], L[200001], R[200001];
	char S[200001][3];
	data d;
	min_heap h[2];
	h[0].size = 0;
	h[1].size = 0;
	scanf("%d %d %d", &N, &M, &Q);
	for (i = 1; i <= N; i++) scanf("%d %s", &(P[i]), S[i]);
	for (i = 1; i <= Q; i++) {
		scanf("%d %d", &(L[i]), &(R[i]));
		d.key = L[i];
		d.id = i;
		push(&(h[0]), d);
	}
	
	int j, k, l, r, block_l[1001], block_r[1001], ans[200001][2], tmp_ans[2], tmp[200001][2], q[1001][3], head, tmpp_ans[2];
	for (k = 0; 1; k++) {
		block_l[k] = k * THR + 1;
		block_r[k] = block_l[k] + THR - 1;
		if (block_r[k] > N) block_r[k] = N;
		if (block_r[k] == N) break;
	}
	for (i = 0; i <= k; i++) {
		while (h[0].size > 0 && h[0].obj[1].key <= block_r[i]) {
			d = pop(&(h[0]));
			d.key = R[d.id];
			push(&(h[1]), d);
		}
		if (h[1].size == 0) continue;
		for (j = 1; j <= M; j++) {
			tmp[j][0] = 0;
			tmp[j][1] = 0;
		}
		tmp_ans[0] = 0;
		tmp_ans[1] = 0;
		while (h[1].size > 0 && h[1].obj[1].key < block_r[i]) {
			d = pop(&(h[1]));
			tmpp_ans[0] = tmp_ans[0];
			tmpp_ans[1] = tmp_ans[1];
			for (l = d.key + 1, r = d.key, head = 0; l > L[d.id]; ) {
				l--;
				q[head][0] = tmp[P[l]][0];
				q[head][1] = tmp[P[l]][1];
				q[head++][2] = P[l];
				if (S[l][0] == 'A') {
					if (tmp[P[l]][0] > 0) tmpp_ans[1] -= tmp[P[l]][1];
					tmp[P[l]][0]++;
					tmp[P[l]][1] = 0;
					if (tmp[P[l]][0] == 1) tmpp_ans[0]++;
				} else {
					if (tmp[P[l]][0] > 0) tmpp_ans[1]++;
					tmp[P[l]][1]++;
				}
			}
			for (head--; head >= 0; head--) {
				tmp[q[head][2]][0] = q[head][0];
				tmp[q[head][2]][1] = q[head][1];
			}
			ans[d.id][0] = tmpp_ans[0];
			ans[d.id][1] = tmpp_ans[1];
		}
		for (l = block_r[i], r = l; h[1].size > 0; r++) {
			if (S[r][0] == 'A') {
				tmp[P[r]][0]++;
				if (tmp[P[r]][0] == 1) {
					tmp_ans[0]++;
					tmp_ans[1] += tmp[P[r]][1];
				}
			} else tmp[P[r]][1]++;
			
			while (h[1].size > 0 && h[1].obj[1].key == r) {
				d = pop(&(h[1]));
				tmpp_ans[0] = tmp_ans[0];
				tmpp_ans[1] = tmp_ans[1];
				for (head = 0; l > L[d.id]; ) {
					l--;
					q[head][0] = tmp[P[l]][0];
					q[head][1] = tmp[P[l]][1];
					q[head++][2] = P[l];
					if (S[l][0] == 'A') {
						if (tmp[P[l]][0] > 0) tmpp_ans[1] -= tmp[P[l]][1];
						tmp[P[l]][0]++;
						tmp[P[l]][1] = 0;
						if (tmp[P[l]][0] == 1) tmpp_ans[0]++;
					} else {
						if (tmp[P[l]][0] > 0) tmpp_ans[1]++;
						tmp[P[l]][1]++;
					}
				}
				for (head--, l = block_r[i]; head >= 0; head--) {
					tmp[q[head][2]][0] = q[head][0];
					tmp[q[head][2]][1] = q[head][1];
				}
				ans[d.id][0] = tmpp_ans[0];
				ans[d.id][1] = tmpp_ans[1];
			}
		}
	}
	for (i = 1; i <= Q; i++) printf("%d %d\n", ans[i][0], ans[i][1]);
	fflush(stdout);
	return 0;
}