CA Loves Stick

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 262144/262144 K (Java/Others)

Description

CA loves to play with sticks.
One day he receives four pieces of sticks, he wants to know these sticks can spell a quadrilateral.
(What is quadrilateral? Click here: https://en.wikipedia.org/wiki/Quadrilateral)

Input

First line contains $T$ denoting the number of testcases.
$T$ testcases follow. Each testcase contains four integers $a,b,c,d$ in a line, denoting the length of sticks.
$1 \le T \le 1000,~0 \le a,b,c,d \le 2^{63}-1$

Output

For each testcase, if these sticks can spell a quadrilateral, output "Yes"; otherwise, output "No" (without the quotation marks).

Sample Input

2 1 1 1 1 1 1 9 2

Sample Output

Yes No

Hint

wange2014

Source

BestCoder Round #78 (div.2)

提交代码