## GUPTA MECHANICAL

IN THIS WEBSITE I CAN TELL ALL ABOUT TECH. TIPS AND TRICKS APP REVIEWS AND UNBOXINGS ALSO TECH. NEWS .............

## [Solution] Dominant Army CodeChef Solution | CodeChef Problem Solution 2022

In the medieval age, there were $3$ kingdoms $A$$B$, and $C$. The army of these kingdom had ${N}_{A}$${N}_{B}$, and ${N}_{C}$ soldiers respectively.

You are given that an army with $X$ soldiers can defeat an army with $Y$ soldiers only if $X>Y$.

An army is said to be dominant if it can defeat both the other armies combined. For example, kingdom $C$'s army will be dominant only if ${N}_{C}>{N}_{A}+{N}_{B}$.

Determine whether any of the armies is dominant or not.

### Input Format

• The first line contains a single integer $T$ - the number of test cases. Then the test cases follow.
• The first and only line of each test case contains three integers ${N}_{A}$${N}_{B}$, and ${N}_{C}$ - the number of warriors in the armies of kingdoms $A$$B$, and $C$ respectively.

### Output Format

For each test case, output YES if any of the armies is dominant. Otherwise, output NO.

You may print each character of YES and NO in uppercase or lowercase (for example, yesyEsYes will be considered identical).

### Constraints

• $1\le T\le 1000$
• $1\le {N}_{A},{N}_{B},{N}_{C}\le 100$