import sys
input = sys.stdin.readline
from bisect import *

N, K, Q = map(int, input().split())
r = [[-1, -1] for _ in range(N)]
c = [[-1, -1] for _ in range(N)]

for i in range(Q):
    A, B, C = input().split()
    
    if A=='R':
        r[int(B)-1] = [i, int(C)-1]
    else:
        c[int(B)-1] = [i, int(C)-1]

rt = [ri[0] for ri in r]
rt.sort()
ct = [ci[0] for ci in c]
ct.sort()
ans = [0]*K

for t, col in r:
    ans[col] += bisect_left(ct, t)

for t, col in c:
    ans[col] += bisect_left(rt, t)

ans[0] += N*N-sum(ans)

for i in range(K):
    print(ans[i])