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();
}
}455A - Boredom | 1099A - Snowball |
1651D - Nearest Excluded Points | 599A - Patrick and Shopping |
237A - Free Cash | 1615B - And It's Non-Zero |
1619E - MEX and Increments | 34B - Sale |
1436A - Reorder | 1363C - Game On Leaves |
1373C - Pluses and Minuses | 1173B - Nauuo and Chess |
318B - Strings of Power | 1625A - Ancient Civilization |
864A - Fair Game | 1663B - Mike's Sequence |
448A - Rewards | 1622A - Construct a Rectangle |
1620A - Equal or Not Equal | 1517A - Sum of 2050 |
620A - Professor GukiZ's Robot | 1342A - Road To Zero |
1520A - Do Not Be Distracted | 352A - Jeff and Digits |
1327A - Sum of Odd Integers | 1276A - As Simple as One and Two |
812C - Sagheer and Nubian Market | 272A - Dima and Friends |
1352C - K-th Not Divisible by n | 545C - Woodcutters |