Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
C. Glass Carving

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputLeonid wants to become a glass carver (the person who creates beautiful artworks by cutting the glass). He already has a rectangular *w* mm × *h* mm sheet of glass, a diamond glass cutter and lots of enthusiasm. What he lacks is understanding of what to carve and how.

In order not to waste time, he decided to practice the technique of carving. To do this, he makes vertical and horizontal cuts through the entire sheet. This process results in making smaller rectangular fragments of glass. Leonid does not move the newly made glass fragments. In particular, a cut divides each fragment of glass that it goes through into smaller fragments.

After each cut Leonid tries to determine what area the largest of the currently available glass fragments has. Since there appear more and more fragments, this question takes him more and more time and distracts him from the fascinating process.

Leonid offers to divide the labor — he will cut glass, and you will calculate the area of the maximum fragment after each cut. Do you agree?

Input

The first line contains three integers *w*, *h*, *n* (2 ≤ *w*, *h* ≤ 200 000, 1 ≤ *n* ≤ 200 000).

Next *n* lines contain the descriptions of the cuts. Each description has the form *H* *y* or *V* *x*. In the first case Leonid makes the horizontal cut at the distance *y* millimeters (1 ≤ *y* ≤ *h* - 1) from the lower edge of the original sheet of glass. In the second case Leonid makes a vertical cut at distance *x* (1 ≤ *x* ≤ *w* - 1) millimeters from the left edge of the original sheet of glass. It is guaranteed that Leonid won't make two identical cuts.

Output

After each cut print on a single line the area of the maximum available glass fragment in mm^{2}.

Examples

Input

4 3 4

H 2

V 2

V 3

V 1

Output

8

4

4

2

Input

7 6 5

H 4

V 3

V 5

H 2

V 1

Output

28

16

12

6

4

Note

Picture for the first sample test:

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/05/2021 11:00:54 (h1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|