Ordering teams

All submissions for this problem are available.
In ACMICPC contests, there are usually three people in a team. For each person in the team, you know their scores in three skills  hard work, intelligence and persistence.
You want to check whether it is possible to order these people (assign them numbers from 1 to 3) in such a way that for each 1 ≤ i ≤ 2, i+1th person is stricly better than the ith person.
A person x is said to be better than another person y if x doesn't score less than y in any of the skills and scores more than y in at least one skill.
Determine whether such an ordering exists.
Input
The first line fo the input contains an integer T denoting the number of test cases.
Each test consists of three lines. Each of these lines contains three space separated integers s_{1}, s_{2} and s_{3} denoting the scores of one member of the team in each of the three skills, in the given order.
Output
For each test case, output a single line containing "yes" if such an ordering exists or "no" if doesn't exist (without quotes).
Constraints
 1 ≤ T ≤ 1000
 1 ≤ s_{1}, s_{2}, s_{3} ≤ 100
Example
Input 3 1 2 3 2 3 4 2 3 5 1 2 3 2 3 4 2 3 4 5 6 5 1 2 3 2 3 4 Output yes no yes
Explanation
Test Case 1: We can order them as (3, 2, 1). Person 3 is better than Person 2 because his scores in the first two skills are not lesser than Person 2's. And in skill 3, Person 3 scores higher. Similarly, Person 2 is better than Person 1. He scores more than Person 1 in every skill, in fact.
Author:  admin2 
Tags  acmind17, admin2, simple, sorting 
Date Added:  30102017 
Time Limit:  1 sec 
Source Limit:  50000 Bytes 
Languages:  C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY 
Comments
 Please login at the top to post a comment.
SUCCESSFUL SUBMISSIONS
Fetching successful submissions
HELP
If you are still having problems, see a sample solution here. 