Triathlon is an athletic contest consisting of three consecutive sections that should be completed as fast as possible as a whole. The first section is swimming, the second section is riding bicycle and the third one is running.
The speed of each contestant in all three sections is known. The judge can choose the length of each section arbitrarily provided that no section has zero length. As a result sometimes she could choose their lengths in such a way that some particular contestant would win the competition.
There are multiple test case in the input file.
The first line of each test case contains an integer number N (1 ≤ N ≤ 100), denoting the number of contestants. Then N lines follow, each line contains three integers Vi, Ui and Wi (1 ≤ Vi, Ui, Wi ≤ 10000),
separated by spaces, denoting the speed of ith contestant in each section.
N = 0 terminates the input.
For every contestant write to the output file one line, that contains
word "Yes" if the judge could choose the lengths of the sections in such a way
that this particular contestant would win (i.e. she is the only one who
would come first), or word "No" if this is impossible.
9 10 2 6 10 7 3 5 6 7 3 2 7 6 2 6 3 5 7 8 4 6 10 4 2 1 8 7 1 5 1 4 0
Yes Yes Yes No No No Yes No Yes Yes
被雷到可能會影響您的身心健康，ACM2009培訓班關心您。(按我繼續)
Migrated from old NTUJ.
NEERC 2000, Ural 1062
| No. | Testdata Range | Score |
|---|