# import sys
# input = sys.stdin.readline
def mp():return map(int,input().split())
def lmp():return list(map(int,input().split()))
import math
import bisect
from copy import deepcopy as dc
from itertools import accumulate
from collections import Counter, defaultdict, deque
def ceil(U,V):return (U+V-1)//V
def modf1(N,MOD):return (N-1)%MOD+1

h,w,q = mp()
d = defaultdict(lambda :h+1)
ans = h*w
for _ in range(q):
    y,x = mp()
    if d[x] > y:
        ans -= d[x]-y
        d[x] = y
    print(ans)