eolymp
bolt
Try our new interface for solving problems
Problems

Venusian programmers

Venusian programmers

Time limit 1 second
Memory limit 64 MiB

Venusian programmers have three big problems. They have to constantly eat wood sweets, iron rolls or stone cookies while working, otherwise they just can’t think. So they have nothing to do at work when all sweets, rolls and cookies are eaten. In this terrible case they go home to continue eating. A lot of Venusian programmers work in some large company. Speed of eating wood, iron and stone is constant and known for each programmer. A programmer can’t eat several products at the same time. Incorruptible Venusian food manager gives out equal quantity of sweets, rolls and cookies to each programmer every morning. It is known that he gives out at least one sweet, at least one roll and at least one cookie. Your task is to find out for each programmer whether food manager is able to give out such quantity of products that this particular programmer eats all food and leaves work first (not simultaneous with any other programmer).

In the first line of input there is one integer number T (1T37) which denotes number of tests. First line of each test contains one integer N (1N100), which determines quantity of programmers working at Venusian company. Each of the following N lines contains integer numbers a_i, b_i, c_i (1a_i, b_i, c_i10000). a_i, b_i, c_i are speeds of eating wood, iron and stone of i-th programmer accordingly. It is guaranteed that all input data is correct. For each Venusian programmer output in separate line "Yes" if it is possible that this particular programmer eat all products and leaves work first. "No" otherwise.

Examples

Input example #1
1
11
10 60 11
20 80 11
25 30 98
28 40 98
29 90 11
30 30 10
35 40 10
40 70 11
50 20 11
50 40 11
50 50 11
Output example #1
No
No
No
Yes
Yes
No
No
Yes
No
No
Yes