CF934A A Compatible Pair

A Compatible Pair

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villages with red colour, light, and cracking noise, all of which frighten the monster out of coming.

Little Tommy has n lanterns and Big Banban has m lanterns. Tommy's lanterns have brightness a1, a2, ..., an, and Banban's have brightness b1, b2, ..., bm respectively.

Tommy intends to hide one of his lanterns, then Banban picks one of Tommy's non-hidden lanterns and one of his own lanterns to form a pair. The pair's brightness will be the product of the brightness of two lanterns.

Tommy wants to make the product as small as possible, while Banban tries to make it as large as possible.

You are asked to find the brightness of the chosen pair if both of them choose optimally.

Input

The first line contains two space-separated integers n and m (2 ≤ n, m ≤ 50).

The second line contains n space-separated integers a1, a2, ..., an.

The third line contains m space-separated integers b1, b2, ..., bm.

All the integers range from  - 109 to 109.

Output

Print a single integer — the brightness of the chosen pair.

Examples

input

Copy

2 2
20 18
2 14

output

252

input

Copy

5 3
-1 0 1 2 3
-1 0 1

output

2

Note

In the first example, Tommy will hide 20 and Banban will choose 18 from Tommy and 14 from himself.

In the second example, Tommy will hide 3 and Banban will choose 2 from Tommy and 1 from himself.

Tommy是想进办法要使值最小所以肯定会隐藏使值最大的在他手上的数，Banban是想进办法使值最大，但是Tommy隐藏了他手中可以使值最大的数，所以最后得到的结果肯定是第二大的数。

做题的时候没有想到。。。

#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define maxn 10000010
#define debug(a) cout << #a << " " << a << endl
using namespace std;
typedef long long ll;
int main() {
    int n,m;
    while( cin >> n >> m ) {
        ll a[],b[];
        for( int i = ; i < n; i ++ ) {
            cin >> a[i];
            b[i] = -2e18;
        }
        for( int j = ; j < m; j ++ ) {
            int t;
            cin >> t;
            for( int i = ; i < n; i ++ ) {
                b[i] = max( b[i], a[i]*t );
            }
        }
        sort(b,b+n);
        cout << b[n-] << endl;
    }
    return ;
}