for _ in range(int(input())):
MooRsy = input()
v = []
u = []
for _ in range(3):
a ,b = [int(i) for i in input().split()]
if a not in v:
v.append(a)
if b not in u:
u.append(b)
if len(v) == 3 or len(u) == 3:
print("Yes")
else:
print("No")#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ulli unsigned ll
#define ld long double
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define vc vector<char>
#define all(v) v.begin(),v.end()
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ls first
#define rs second
#define FAST ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
const ll M=(ll)(pow(10,9)+7);
int x[4],y[4];
void solve()
{
FAST;
for(int i=0;i<3;i++)
{
cin>>x[i];
cin>>y[i];
}
if ((x[0]==x[1]||x[1]==x[2]||x[2]==x[0])&&(y[0]==y[1]||y[1]==y[2]|y[2]==y[0])) cout<<"NO\n";
else cout<<"YES\n";
}
int main()
{
FAST;
int t;
cin>>t;
while(t--)
{
solve();
}
}150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |