W,H,n=map(int,input().split())
M=[[0]*H for i in range(W)]
Bs={"A":[[1],[1],[1],[1]],"B":[[1]*3],"C":[[1,1],[1,1]],"D":[[0,0,1],[1,1,1]],"E":[[0,1],[1,1],[1,1]]}
success=0;space=0
for _ in range(n):
    t,x=input().split()
    x=int(x)
    flag=True
    B=Bs[t]
    h,w=len(B),len(B[0])
    #檢查小方塊可以塞的左上角位置
    for y in range(H-w,-1,-1):
        for i in range(h):
            for j in range(w):
                if M[x+i][y+j]==1 and B[i][j]==1:
                    flag=False
        if flag==False:
            y+=1
            break
            #將小方塊填入大方格
    if y<=H-w:
        success+=1
        for i in range(h):
            for j in range(w):
                M[x+i][y+j]+=B[i][j]
for row in M:
    space+=row.count(0)
print(space,n-success)