Kunai#3386

Kunai

10 seconds

256 megabytes

Medium

Kunai is an acuate weapon used by ninjas whose shape is similar to a knife. Ninjas were attacking their enemies by throwing kunais against them.

There are $n$ ninjas in a grid of squares with $w$ columns and $h$ rows. Every ninja is in the center of a square, and no two ninjas share the same square. Each ninja has a kunai, and looks toward one of the four directions; up, down, left, or right. At time $0$ , every ninja threw his/her kunai to the direction he/she is looking toward.

Every kunai proceeds straight with speed $1$ . If more than one kunai comes to the same place at the same time, they clash with each other and disappear. The size of a kunai is so small that we can ignore it. Also, since ninjas can move quickly, they will not be hit by kunais. Each kunai continues to proceed along its direction without losing its speed unless it is clashed with another kunai.

In the following ﬁgures, the arrows represent kunais. The direction of an arrow describes the direction of a kunai. In these ﬁgures, all thick arrows will clash.

On the other hand, in each of the following ﬁgures, a thick arrow will not clash with another thick arrow. In the second and the third ﬁgure, a thin arrow clashes with a thick arrow. Because clashed arrows will disappear, a thick arrow will not clash with another thick arrow in each of these ﬁgures.

Task

Count the number of squares in the $w \times h$ w \times h grid where kunais pass through after a sufficient amount of time passed.

Constraints

$1 \leq n \leq 100000$ 1 \leq n \leq 100000 - The number of ninjas

$1 \leq w \leq 1000000000$ 1 \leq w \leq 1000000000, $1 \leq h \leq 1000000000$ 1 \leq h \leq 1000000000 - The size of the grid

$1 \leq x_{i} \leq w$ 1 \leq x_i \leq w, $1 \leq y_{i} \leq h$ 1 \leq y_i \leq h - The coordinates of ninjas

Input

The ﬁrst line contains two space separated integers $w$ , $h$ , which describe the size of the grid. The second line of input contains an integer $n$ , the number of ninjas. The $i$ -th line ( $1 \leq i \leq n$ 1 \leq i \leq n) of the following $n$ lines contains three space separated integers $x_{i}$ x_i, $y_{i}$ y_i, $d_{i}$ d_i, describing that the position of the ninja $i$ is in the $x_{i}$ x_i-th column from left and $y_{i}$ y_i-th row from above. No two ninjas share the same position. The direction of the ninja $i$ is described by the value of $d_{i}$ d_i.

When $d_{i} = 0$ d_i = 0, the ninja $i$ is looking toward the right.
When $d_{i} = 1$ d_i = 1, the ninja $i$ is looking upward.
When $d_{i} = 2$ d_i = 2, the ninja $i$ is looking toward the left.
When $d_{i} = 3$ d_i = 3, the ninja $i$ is looking downward.

Output

Output the number of squares in the $w \times h$ w \times h grid where kunais pass through after a sufficient amount of time passed.

Examples

Example 1

Note

Example 1

In this example, the grid at time $0$ is described as follows.

The kunai thrown by the ninja $i$ is denoted by the kunai $i$ . At time $0.5$ , the kunai $2$ and the kunai $3$ will clash each other and disappear. The following ﬁgure describes the grid at time $1$ . Here gray squares denote the squares where kunais already passed through.

At time $2$ , the kunai $1$ and the kunai $5$ will clash each other and disappear. The grid at time $2$ is described as follows.

No more kunais are clashed in a square after time $2$ . The grid after a sufficient amount of time passed is described as follows.

Finally, the number of squares in the grid where kunais pass through is $11$ . Therefore, we should output $11$ .