A rectangular sheet has been divided into four rectangles by one horizontal cut and one vertical cut. Each cut goes all the way from one edge of the sheet to the opposite edge, and the pieces are not moved between the cuts.
You are given four positive integers , , , and . Determine whether the areas of the four pieces can be these numbers, in any order.
The dimensions of the sheet and the positions of the cuts can be chosen freely; they do not have to be integers.
The first line contains the number of test cases . Each test case consists of one line containing , , , and .
For each test case, output if such a sheet and cuts exist, or otherwise.
You may print each letter in any case. For example, , , and are all accepted.
Take a square with side length and cut it halfway in both directions. All four pieces have area .
No choice of a rectangular sheet and two cuts produces pieces with areas , , , and .
Take a sheet of width and height . Split its width into and , and its height into and . The piece areas are , , , and .
If three pieces all have area , the two parts of the width must be equal and the two parts of the height must also be equal. The fourth piece would then have area , not .
Take a sheet of width and height . Split its width into and , and its height into and . The piece areas are , , , and .