H, W, Q = map(int, input().split())

min_y = dict()  # Key: X-coordinate, Value: minimum Y encountered
processed_count = 0
sum_valid = 0

for _ in range(Q):
    Y, X = map(int, input().split())
    if X in min_y:
        current_min = min_y[X]
        if Y < current_min:
            sum_valid += (Y - 1) - (current_min - 1)
            min_y[X] = Y
    else:
        sum_valid += (Y - 1)
        processed_count += 1
        min_y[X] = Y
    total = (W - processed_count) * H + sum_valid
    print(total)