C. Two Seals

C. Two Seals

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

One very important person has a piece of paper in the form of a rectangle a × b.

Also, he has n seals. Each seal leaves an impression on the paper in the form of a rectangle of the size x_i × y_i. Each impression must be parallel to the sides of the piece of paper (but seal can be rotated by 90 degrees).

A very important person wants to choose two different seals and put them two impressions. Each of the selected seals puts exactly one impression. Impressions should not overlap (but they can touch sides), and the total area occupied by them should be the largest possible. What is the largest area that can be occupied by two seals?

Input

The first line contains three integer numbers n, a and b (1 ≤ n, a, b ≤ 100).

Each of the next n lines contain two numbers x_i, y_i (1 ≤ x_i, y_i ≤ 100).

Output

Print the largest total area that can be occupied by two seals. If you can not select two seals, print 0.

Examples

Input

2 2 2
1 2
2 1

Output

4

Input

4 10 9
2 3
1 1
5 10
9 11

Output

56

Input

3 10 10
6 6
7 7
20 5

Output

0

Note

In the first example you can rotate the second seal by 90 degrees. Then put impression of it right under the impression of the first seal. This will occupy all the piece of paper.

In the second example you can't choose the last seal because it doesn't fit. By choosing the first and the third seals you occupy the largest area.

In the third example there is no such pair of seals that they both can fit on a piece of paper.

这题一开始想简单了，结果哇了好几次。其实就是很简单。

由于数据量太小，就直接暴力枚举就成了。

 

#include <iostream>
#include <cstdio>
#include <cstring>
#include <set>
#include <algorithm>
using namespace std;
struct Node{
    int x,y,z;
}node[105];
int main(){
    int k,n,m,a,b,xn,xm,Max=0;
    cin>>k>>n>>m;
    a=max(n,m);
    b=min(n,m);
    for(int i=1;i<=k;i++){
        cin>>xn>>xm;
        node[i].x=max(xn,xm);
        node[i].y=min(xn,xm);
        node[i].z=xn*xm;
    }

    for(int i=1;i<=k-1;i++){
        for(int j=i+1;j<=k;j++){
            if(node[i].x<=b&&node[j].x<=b&&(node[i].y+node[j].y)<=a)
                Max=max(Max,(node[i].z+node[j].z));
            if(node[i].y<=b&&node[j].y<=b&&(node[j].x+node[i].x)<=a)
                Max=max(Max,(node[i].z+node[j].z));
            if(node[i].x<=a&&node[j].x<=a&&(node[i].y+node[j].y)<=b)
                Max=max(Max,(node[i].z+node[j].z));
            if(node[i].y<=a&&node[j].y<=a&&(node[i].x+node[j].x)<=b)
                Max=max(Max,(node[i].z+node[j].z));
            if(node[i].x<=b&&node[j].y<=b&&(node[i].y+node[j].x)<=a)
                Max=max(Max,(node[i].z+node[j].z));
            if(node[i].x<=a&&node[j].y<=a&&(node[i].y+node[j].x)<=b)
                Max=max(Max,(node[i].z+node[j].z));
            if(node[i].y<=a&&node[j].x<=a&&(node[i].x+node[j].y)<=b)
                Max=max(Max,(node[i].z+node[j].z));
            if(node[i].y<=b&&node[j].x<=b&&(node[i].x+node[j].y)<=a)
                Max=max(Max,(node[i].z+node[j].z));
        }
    }
    cout<<Max<<endl;
    return 0;
}