import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
#sys.set_int_max_str_digits(10**9)

N,K,Q=map(int,readline().split())
colorH=[(-1,0)]*N
colorW=[(-1,0)]*N
for q in range(Q):
    A,B,C=readline().split()
    B,C=int(B)-1,int(C)-1
    if A=="R":
        colorH[B]=(q,C)
    else:
        colorW[B]=(q,C)
H,W=N,N
query=[(q,C,"R") for q,C in colorH]+[(q,C,"C") for q,C in colorW]
query.sort(reverse=True)
ans_lst=[0]*K
for q,c,S in query:
    if S=="R":
        ans_lst[c]+=W
        H-=1
    else:
        ans_lst[c]+=H
        W-=1
print(*ans_lst,sep="\n")