KRAVE

Time limit5sMemory limit256 MB

Summary

You extend a horizontal or vertical fence from each given point across its current field and report the two resulting areas in order.

Level: Medium6 of 10
Topics: Intervals, Binary search, Simulation
Solved: No attempts yet

Problem

A meadow is an $A \times B$ rectangle. From point $(X,Y)$ , build a horizontal or vertical fence until it hits another fence. After each fence, print the areas of the two new fields, smaller first.

Input

$A$ , $B$ , $N$ , then $N$ lines with $X$ , $Y$ , $D$ ( $1$ horizontal, $2$ vertical).

Output

$N$ lines, two 64-bit integers per line.

Examples3

Example 1

Input

Expected output

Example 2
Input
```
4 4
3
2 2 2
1 2 1
3 2 1
```
Expected output
```
8 8
4 4
4 4
```

Example 3

Input

Expected output