Answer Happy

Winning team John organizes a competition where a team of three people can participate. Score of each person in three different skills i.e hardwork, intelligence and persistence, the task is to check whether it is possible to order these people in such a way that for each 1 ≤ i ≤ 2, i+1-th person is strictly better than the i-th person A person a is better than b if a scores more than b in at least one skill and a does not score less than b in any of skills. Find 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 s1, s2 and s3 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
Output For each test case, output a single line containing "yes" if such an ordering exists or "no" if doesn't exist (without quotes). STDIN 1 123 125 678 OUTPUT yes Explanation Person3 is better than person2 as person3 scores better in all 3 skills than person2. Similarly, person 2 is better than person 1 as in first two skills he scores not less tha person1 and in third skills scores more than person1
OUTPUT yes Explanation Person3 is better than person2 as person3 scores better in all 3 skills person2. Similarly, person 2 is better than person 1 as in first two skills he scores n person1 and in third skills scores more than person1 Sample Input Sample Output yes 123 234 Q Type here to search O
Winning team John organizes a competition where a team of three people can participate. Score of each person in three different skills i.e hardwork, intelligence and persistence. the task is to check whether it is possible to order these people in such a way that for each 1 ≤ i ≤ 2, i+1-th person is strictly better than the i-th person A person a is better than b if a scores more than b in at least one skill and a does not score less than b in any of skills. Find 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 s1, s2 and s3 denoting the scores of one member of the team in each of the three skills, in the given order. Output 2 4 5 6-{ 8 9 10 11 imp imp cl }
est case, output a single line containing "yes" if such an ordering exists ist (without quotes).
s1, s2 and s3 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). STDIN 1 123 125 678 OUTPUT yes Explanation Person3 is better than person2 as person3 scores better in all 3 skills than person2. Similarly, person 2 is better than person 1 as in first two skills he scores not less than nercon1 and in third chille croras more than norcan1
OUTPUT yes Explanation Person3 is better than person2 as person3 scores better in all 3 skills than person2. Similarly, person 2 is better than person 1 as in first two skills he scores not less than person1 and in third skills scores more than person1 Sample Input Sample Output 1 yes 123 234