Kornislav

Kornislav the turtle plays the following game.  He asks his friend
Kladislav for four positive integers.  Then Kornislav moves in one
direction, turns 90 degrees, walks in the new direction, etc.  He
makes 3 90-degree turns and walks along four segments whose lengths
(in metres) are determined by the numbers he got from Kladislav.
Kornislav must use each of the four integers exactly once as the
length of one of the legs of his path.

Depending on the order that Kornislav uses the numbers, his walk makes
different shapes.  His goal is that the path he walks along should
enclose a rectangle that is as large as possible. 

Input
-----

The first line will contain a single positive integer n, which is the
number of problem instances.

Next, there will be n lines, each representing an instance of the
problem.  Each such line will contain four positive integers separated
by a space. 

Output
------

For each input instance, output the area of the largest rectangle that
can be enclosed by Kornislav's walk, in square metres.

Sample Input
------------

2
1 2 3 4
4 4 3 4

Sample Output
-------------

3
12

[Problem Source:  Croatian Open Competition]