#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

struct Frac {
	LL p, q;
	Frac() { };
	Frac(LL pp, LL qq = 1) {
		if(qq < 0) { pp *= -1; qq *= -1; }
		LL d = gcd(pp, qq);
		p = pp / d; q = qq / d;
	}
	bool operator< (const Frac & obj) const { return p * obj.q <  obj.p * q; }
	bool operator> (const Frac & obj) const { return p * obj.q >  obj.p * q; }
	bool operator<=(const Frac & obj) const { return p * obj.q <= obj.p * q; }
	bool operator>=(const Frac & obj) const { return p * obj.q >= obj.p * q; }
	bool operator==(const Frac & obj) const { return p * obj.q == obj.p * q; }
	bool operator!=(const Frac & obj) const { return p * obj.q != obj.p * q; }
	Frac operator+ (const Frac & obj) const { return Frac(p * obj.q + obj.p * q, q * obj.q); }
	Frac operator- (const Frac & obj) const { return Frac(p * obj.q - obj.p * q, q * obj.q); }
	Frac operator* (const Frac & obj) const { return Frac(p * obj.p, q * obj.q); }
	Frac operator/ (const Frac & obj) const { return Frac(p * obj.q, q * obj.p); }
};

int n;
Frac x[3], y[3];

bool g(Frac t) {
	Frac l[3];
	inc(i, 3) { l[i] = x[i] + y[i] * t; }
	
	return ((l[0] != l[2] && l[0] < l[1] && l[1] > l[2]) || (l[0] != l[2] && l[0] > l[1] && l[1] < l[2]));
}

int main() {
	cin >> n;
	inc(q, n) {
		int z;
		inc(i, 3) { cin >> z; x[i] = Frac(z); }
		inc(i, 3) { cin >> z; y[i] = Frac(z); }
		
		vector<Frac> v;
		v.PB(Frac(0));
		inc(i, 3) {
			int j = (i + 1) % 3;
			if(y[i] == y[j]) { continue; }
			Frac t = (x[j] - x[i]) / (y[i] - y[j]);
			if(Frac(0) < t) { v.PB(t); }
		}
		sort(ALL(v));
		v.PB(v.back() + Frac(1));
		
		bool f = false;
		inc(i, v.size() - 1) {
			Frac t = (v[i] + v[i + 1]) / Frac(2);
			f |= g(t);
		}
		
		cout << (f ? "YES" : "NO") << "\n";
	}
	
	return 0;
}