Triathlon

A triathlon is an athletic contest made up of three consecutive stages that must be completed as fast as possible overall. The first stage is swimming, the second is cycling, and the third is running.

The speed of every contestant in each of the three stages is known. The referee may choose the length of each stage arbitrarily, subject only to the condition that no stage has length $0$. If the stage lengths are $a$ (swimming), $b$ (cycling), and $c$ (running), then a contestant with speeds $V$, $U$, and $W$ finishes in total time $\frac{a}{V} + \frac{b}{U} + \frac{c}{W}$.

By choosing the stage lengths cleverly, the referee can sometimes arrange for a particular contestant to win. A contestant wins when their total time is uniquely the smallest (that is, they are the sole first-place finisher). For each contestant, determine whether the referee can choose positive lengths for all three stages so that this contestant becomes the unique winner.

The first line contains an integer $N$ ($1 \le N \le 100$), the number of contestants. Each of the next $N$ lines contains three integers $V_i$, $U_i$, and $W_i$ ($1 \le V_i, U_i, W_i \le 10000$), separated by spaces: the speed of the $i$-th contestant in the swimming, cycling, and running stages, respectively.

Print $N$ lines. On the $i$-th line, print Yes if the referee can choose positive stage lengths so that the $i$-th contestant is the unique winner, or No otherwise.