Loading...
Peaceful Catland
Time: 2 s
Memory: 125 MB
In Catland, there are three types of cats: black, white, and orange. The government of Catland has defined that a city is considered peaceful if the number of orange cats in the city is strictly less than the total number of the other cats combined.
 

You were assigned by the government of catland to determine if the city is peaceful. 
Input
The first line contains a single integer \( t \) the number of test cases.
Each of the next t lines contains three integers \( a, b, \) and \(c- \) \(\)the number of black, white, and orange cats, respectively.
 
Constraint
\(1 \leq t \leq 10^3 \)
\(0 \leq a, b, c \leq 10^9\)
Output
For each test case, print a single line:

"Yes" (without quotes) if the city is peaceful.
"No" (without quotes) otherwise.
Examples
Input
Output
5
2 5 3
1 3 8
5 4 11
2 6 3
3 14 5
Yes
No
No
Yes
Yes
Problem Info
Problem ID 380
Time Limit 2000 ms
Memory Limit 128000 KB
Moderators meheraj_hossain_ , amirhozaifa , refred1 , lauhemahfus , osama_bq , tafsiruzzaman , sagorahmedmunna , Dr_KeK , Rakib , fahimcp495
Statistics
Submit
You need to Login or Registration for submit your solution