Codeforces-527c

Leonid 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 formH y or V x. In the first case Leonid makes the horizontal
cut at the distance ymillimeters (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².

Example

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:

Picture for the second sample test:

题解：可以用set和multiset来写； 用multiset来记录其分割后的长和宽，其中最大长和最大宽的乘积即为最大面积；

AC代码为：

#include<iostream>

#include<algorithm>

#include<set>

#include<string>

#include<cstdio>

using namespace std;

set<int> Width;

set<int> High;

multiset<int> widths;

multiset<int> highs;

int main()

{

    int w,h,n;

    scanf("%d%d%d",&w,&h,&n);

    Width.insert(0);

    Width.insert(w);

    High.insert(0);

    High.insert(h);

    widths.insert(w);

    highs.insert(h);

    

    for(int i=0; i<n; i++)

    {

        string o;

        int x;

        cin>>o>>x;

       

        if(o[0]=='H')

        {

            High.insert(x);

            int a=*(--High.find(x));

            int b=*(++High.find(x));

            highs.erase(highs.find(b-a));

            highs.insert(x-a);

            highs.insert(b-x);

            

        }

        else

        {

            Width.insert(x);

            int a=*(--Width.find(x));

            int b=*(++Width.find(x));

            widths.erase(widths.find(b-a));

            widths.insert(x-a);

            widths.insert(b-x);

            

        }

        long long maxh=*(--highs.end());

        long long maxw=*(--widths.end());

        printf("%lld\n",maxh*maxw);

    }

    return 0;

}