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.
The first line contains an integer N, denoting the number of contestants
(1 ≤ N ≤ 100).
Then N lines follow, each line contains integers
Vi, Ui and Wi, denoting the speed of ith
contestant in each section
(1 ≤ Vi, Ui, Wi ≤ 10000)
For every contestant output 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.
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
Problem Source: 2000-2001 ACM Northeastern European Regional Programming Contest