Venusian programmers#227
Venusian programmers have three main problems. They must constantly eat wood candies, iron bagels, and stone cookies while working; otherwise, they simply cannot think. Once all candies, bagels, and cookies are gone, they have nothing else to do at work. In that dreadful case, they go home to eat more.
A large company employs many Venusian programmers. Each programmer has a constant and known rate of eating wood, iron, and stone. Programmers cannot eat multiple products simultaneously. An incorruptible Venusian food manager distributes equal amounts of candies, bagels, and cookies to each programmer every morning. It is known that everyone receives at least one candy, one bagel, and one cookie.
Your task: for each programmer, determine whether the manager can distribute such quantities of products that this specific programmer finishes eating all the food and leaves work first (not simultaneously with any other programmer).
The first line contains the integer (1 \le T \le 37), the number of tests. The first line of each test contains an integer (1 \le N \le 100), the number of programmers in the Venusian company. Each of the next lines contains a_i, b_i, c_i (1 \le a_i, b_i, c_i \le 10000), where a_i, b_i, and c_i are the rates at which the -th programmer eats wood, iron, and stone, respectively. All input data is guaranteed to be correct.
For each Venusian programmer, output on a separate line Yes (without quotes) if it is possible for this programmer to eat all the products and leave work first; otherwise, output No (without quotes).
Example 1