F. 4 Rectangles and 1 Square
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Given four rectangles, can you piece them together without overlap to form a perfect square?

Input

The first line contains an integer $$$T~(1 \le T \le 1000)$$$, representing the number of test cases.

Each subsequent test case spans four lines, with each line containing two integers $$$a,b~(1 \le a , b \le 10^4)$$$, indicating the length and width of a rectangle, respectively.

Output

Output the result of each case line by line. If it can be formed, print "Yes"; otherwise, print "No".

Example
Input
2

1 1
1 2
1 3
2 5

1 4
1 4
1 4
1 4
Output
No
Yes