A

A - A Compatible Pair

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 a₁, a₂, ..., a_n, and Banban's have brightness b₁, b₂, ..., b_m 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 a₁, a₂, ..., a_n.

The third line contains m space-separated integers b₁, b₂, ..., b_m.

All the integers range from  - 10⁹ to 10⁹.

Output

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

Examples

Input

2 2
20 18
2 14

Output

252

Input

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.

#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
long long cmp(long long x,long long y)
{
    return x > y;
}

int main()
{
    long long a[101],b[51],c[5201],n,m;
    cin >> n >> m;
    if(n >= 2 && m <= 50)
    {
        for(int i = 0;i < n;i++)
            cin >> a[i];
        for(int i = 0;i < m;i++)
            cin >> b[i];
        sort(a,a + n,cmp);
        sort(b,b + m,cmp);
        for(int i = 0;i < n;i++)
        {
            c[i] = a[i] * b[0];
            for(int j = 1;j < m;j++)
            {
                c[i] = max(c[i],a[i] * b[j]);
            }
        }
        sort(c,c + n,cmp);
        cout << c[1] << endl;
//    for(int i = 0;i < n;i++)
//        cout << a[i] << " ";
//    cout << endl;
//    for(int i = 0;i < m;i++)
//        cout << b[i] << " ";
    }
    return 0;
}

排除出一个最大值的就ok了