B'Monocarp wants to draw four line segments on a sheet of paper. He wants the i -th segment to have its length equal to a_i ( 1 <= 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 1 , 2 , 3 and 4 , he can do it the following way: Calculate the maximum area of a rectangle Monocarp can enclose with four segments. The first line contains one integer t ( 1 <= t <= 3 cdot 10^4 ) -- the number of test cases. Each test case consists of a single line containing four integers a_1 , a_2 , a_3 , a_4 ( 1 <= a_i <= 10^4 ) -- the lengths of the segments Monocarp wants to draw. 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). The first test case of the example is described in the statement. For the second test case, Monocarp can draw the segments AB , BC , CD and DA as follows: '...