#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
bool solve(int x1, int x2, int x3, int y1, int y2, int y3) {
	bool res;
	double mn = 0;
	double mx;
	bool s = false;
	if (y1 == y2 && x1 >= x2) {
		return false;
	}
	if (y3 == y2 && x3 >= x2) {
		return false;
	}
	if (y3 == y1 && x1 == x3) {
		return false;
	}
	if (y1 > y2) {
		if (!s) {
			s = true;
			mx = (x1 - x2) / (double)(y2 - y1);
		}
		else {
			mx = min(mx, (x1 - x2) / (double)(y2 - y1));
		}
	}
	else if (y1 < y2) {
		mn = max(mn, (x1 - x2) / (double)(y2 - y1));
	}
	if (y3 > y2) {
		if (!s) {
			s = true;
			mx = (x3 - x2) / (double)(y2 - y3);
		}
		else {
			mx = min(mx, (x3 - x2) / (double)(y2 - y3));
		}
	}
	else if (y3 < y2) {
		mn = max(mn, (x3 - x2) / (double)(y2 - y3));
	}
	if (!s)mx = mn + 1;
	if (mx > mn) {
		return true;
	}
	else {
		return false;
	}

}
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N;
	cin >> N;
	int x1, x2, x3, y1, y2, y3;
	while (N--) {
		cin >> x1 >> x2 >> x3 >> y1 >> y2 >> y3;
		if (solve(x1, x2, x3, y1, y2, y3) || solve(-x1, -x2, -x3, -y1, -y2, -y3)) {
			cout << "YES" << endl;
		}
		else {
			cout << "NO" << endl;
		}
	}
}