B"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, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an, and Banban's have brightness b1, xe2 x80 x89b2, xe2 x80 x89..., xe2 x80 x89bm 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. The first line contains two space-separated integers n and m (2 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n, xe2 x80 x89m xe2 x80 x89 xe2 x89 xa4 xe2 x80 x8950). The second line contains n space-separated integers a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an. The third line contains m space-separated integers b1, xe2 x80 x89b2, xe2 x80 x89..., xe2 x80 x89bm. All the integers range from xe2 x80 x89- xe2 x80 x89109 to 109. Print a single integer -- the brightness of the chosen pair. 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. "...