#include "bits/stdc++.h"
using namespace std;
     
#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl
     
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll, ll>
const int inf = 1000000001;
const ll INF = 1e18;
#define MOD 1000000007
#define mod 1000000009
#define pi 3.14159265358979323846
#define Sp(p) cout<<setprecision(15)<<fixed<<p<<endl;
int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };

#define P complex<double>

// 許容する誤差ε
#define EPS (1e-8)
// 2つのスカラーが等しいかどうか
#define EQ(a,b) (abs((a)-(b)) < EPS)
// 2つのベクトルが等しいかどうか
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )


// 外積 (cross product) : a×b = |a||b|sinΘ
double cross(P a, P b) {
	return (a.real() * b.imag() - a.imag() * b.real());
}

// a1,a2を通る直線とb1,b2を通る直線の交点計算
P intersection_l(P a1, P a2, P b1, P b2) {
	P a = a2 - a1; P b = b2 - b1;
	return a1 + a * cross(b, b1 - a1) / cross(b, a);
}

bool judge(vector<double> x, vector<double> y, double t) {
  vector<double> nowx(3);
  for (int i = 0; i < 3; i++) {
    nowx[i] = x[i] + t * y[i];
  }
  if (EQ(nowx[0], nowx[1]) || EQ(nowx[1], nowx[2]) || EQ(nowx[0], nowx[2])) {
    return false;
  }
  if ((nowx[1] - nowx[0]) * (nowx[1] - nowx[2]) > 0) {
    return true;
  }
  else {
    return false;
  }
}

int main() {
  int n, i, j;
  cin >> n;
  for (int uuu = 0; uuu < n; uuu++) {
    vector<double> x(3), y(3);
    cin >> x[0] >> x[1] >> x[2] >> y[0] >> y[1] >> y[2];
    if (judge(x, y, 0)) {
      cout << "YES" << endl;
      continue;
    }
    vector<double> t;
    t.push_back(0);
    t.push_back(100000);
    for (i = 0; i < 3; i++) {
      for (j = i + 1; j < 3; j++) {
	if (EQ(y[i], y[j])) {
	  continue;
	}
	P a0 = P(0, x[i]);
	P a1 = P(1, x[i] + y[i]);
	P b0 = P(0, x[j]);
	P b1 = P(1, x[j] + y[j]);
	t.push_back(real(intersection_l(a0, a1, b0, b1)));
      }
    }
    sort(t.begin(), t.end());
    //DEBUG_VEC(t);
    for (i = 1; i < t.size(); i++) {
      double mid = (t[i] + t[i - 1]) / 2;
      if (mid < 0) {
	continue;
      }
      if (judge(x, y, mid)) {
	cout << "YES" << endl;
	i = 1000000;
      }
    }
    if (i < 1000000) {
      cout << "NO" << endl;
    }
	
  }
}

/*
int main() {
  int n, i, j;
  cin >> n;
  vi money;
  i = 1;
  while (i * (i + 1) / 2 <= n) {
    money.push_back(i * (i + 1) / 2);
    i++;
  }
  //DEBUG_VEC(money);
  int ans = 0;
  j = money.size() - 1;
  while (n > 0) {
    if (n >= money[j]) {
      ans += n / money[j];
      n %= money[j];
    }
    j--;
  }
  cout << ans << endl;
    
    
}
*/