Monocarp wants to draw four line segments on a sheet of paper. He wants the ii-th segment to have its length equal to aiai (1≤i≤41≤i≤4). These segments can intersect with each other, and each segment should be either horizontal or vertical.
Monocarp wants to draw the segments in such a way that they enclose a rectangular space, and the area of that rectangular space should be maximum possible.
For example, if Monocarp wants to draw four segments with lengths 11, 22, 33 and 44, he can do it the following way:
Here, Monocarp has drawn segments ABAB (with length 11), CDCD (with length 22), BCBC (with length 33) and EFEF (with length 44). He got a rectangle ABCFABCF with area equal to 33 that is enclosed by the segments.
Calculate the maximum area of a rectangle Monocarp can enclose with four segments.
Input
The first line contains one integer tt (1≤t≤3⋅1041≤t≤3⋅104) — the number of test cases.
Each test case consists of a single line containing four integers a1a1, a2a2, a3a3, a4a4 (1≤ai≤1041≤ai≤104) — the lengths of the segments Monocarp wants to draw.
Output
For each test case, print one integer — the maximum area of a rectangle Monocarp can enclose with four segments (it can be shown that the answer is always an integer).
Example
Input
4
1 2 3 4
5 5 5 5
3 1 4 1
100 20 20 100
Output
3
25
3
2000
Note
The first test case of the example is described in the statement.
For the second test case, Monocarp can draw the segments ABAB, BCBC, CDCD and DADA as follows:
Here, Monocarp has drawn segments ABAB (with length 55), BCBC (with length 55), CDCD (with length 55) and DADA (with length 55). He got a rectangle ABCDABCD with area equal to 2525 that is enclosed by the segments.
#include <stdio.h>
int main()
{
int n,m,t,a[100],k,i,j,c,b,d;
scanf("%d",&m);
while(~scanf("%d%d%d%d",&a[0],&a[1],&a[2],&a[3]))
{
for(i=0;i<3;i++)
{
for(j=0;j<3-i;j++)
{
if(a[j]>=a[j+1])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
}
printf("%d\n",a[0]*a[2]);
}
return 0;
}