시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
5 초 256 MB 12 9 9 75.000%

## 문제

Mirko has bought himself a meadow in the coordinate system. The meadow is in the shape of a rectangle A meters wide and B meters high, whose sides are parallel to coordinate axes. The lower left edge of the meadow is located on point (0, 0) and the upper right on point (A, B).

Mirko has decided to build horizontal and vertical fences on his meadow. He does this in the following way: first, he picks a point (X, Y ) through which no fence has passed so far and decides whether the new fence is going to be horizontal or vertical. After that, he builds the fence in the chosen direction until he bumps into another fence and connects them there, then goes back and finishes the other part of the fence in the same way.

Slika 1: The image above shows the meadow’s layout after all the fences have been built from the first test case. The points where Mirko starts building and the order of building is marked.

Notice that this procedure divides the meadow into a certain number of fields, where each field is a rectangle with fences on the sides and without fences in its interior. More specifically, every newly added fence divides an existing field into exactly two new fields.

Write a programme that will, based on the descriptions of fences that are built starting from an empty meadow, after each built fence find the area of the two newly appeared fields. Output the areas of these two fields sorted in ascending order.

## 입력

The first line of input contains two integers A and B (2 ≤ A, B ≤ 105), the width and height of the meadow.

The second line of input contains the integer N (1 ≤ N ≤ 105), the number of fences being built.

Each of the following N lines contains three integers X, Y, D (0 < X < A, 0 < Y < B, D ∈ {1, 2}), coordinates of the point where Mirko starts building the fence and the fence direction. Mirko builds a horizontal fence if D = 1 and a vertical one if D = 2.

Regarding point (X, Y), up until that moment there won’t be a fence passing through it.

## 출력

The output must consist of N lines. For each fence being built, you must output two space-separated integers in a single line, the area of the smaller newly appeared field and the area of the bigger field, respectively.

Please note: The required areas may not fit into the 32-bit integer type. We advise you to use the 64-bit type, for example long long (C/C++) or int64 (Pascal).

## 예제 입력

9 7
5
3 3 2
7 2 1
6 3 2
5 4 1
1 4 1


## 예제 출력

21 42
12 30
15 15
6 9
9 12


## 예제 입력 2

4 4
3
2 2 2
1 2 1
3 2 1


## 예제 출력 2

8 8
4 4
4 4


## 예제 입력 3

9 7
10
6 1 2
2 6 2
8 5 2
5 2 2
4 3 1
1 2 1
7 6 1
3 4 1
1 4 1
7 2 1


## 예제 출력 3

21 42
14 28
7 14
7 21
9 12
4 10
2 12
3 9
4 6
4 8