#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
int N;
double X[3], Y[3];
double maxT[3], minT[3];
double maxS[3], minS[3];

void update(int side) {
    double base = Y[side]-Y[1];
    double border = (X[1]-X[side])/base;
    if (base > 0) {
        maxT[side] = border;
        minT[side] = 0;
        
        maxS[side] = INT_MAX;
        minS[side] = max(0.0, border);
    } else if (base < 0) {
        maxT[side] = INT_MAX;
        minT[side] = max(0.0, border);
        
        maxS[side] = border;
        minS[side] = 0.0;
    } else {
        if (X[1] > X[side]) {
            // 常に最大
            maxT[side] = INT_MAX;
            minT[side] = 0;
        } else {
            // 最大になることはない
            maxT[side] = -1;
            minT[side] = 0;
        }
        if (X[1] < X[side]) {
            // 常に最小
            maxS[side] = INT_MAX;
            minS[side] = 0;
        } else {
            // 最小になることはない
            maxS[side] = -1;
            minS[side] = 0;
        }
    }
}

bool checkMax() {
    if (X[0]==X[2] && Y[0]==Y[2]) return false;
    for (int i=0; i<3; i+=2) {
        if (maxT[i]<minT[i]) return false;
    }
    if (maxT[0] <= minT[2]) return false;
    if (maxT[2] <= minT[0]) return false;
    return true;
}

bool checkMin() {
    if (X[0]==X[2] && Y[0]==Y[2]) return false;
    for (int i=0; i<3; i+=2) {
        if (maxS[i]<minS[i]) return false;
    }
    if (maxS[0] <= minS[2]) return false;
    if (maxS[2] <= minS[0]) return false;
    return true;
}

void solve() {
    cin>>N;
    while(N--) {
        REP(i,3)cin>>X[i];
        REP(i,3)cin>>Y[i];
        update(0);
        update(2);
        bool ok = checkMax() || checkMin();
        cout << (ok ? "YES" : "NO") << endl;
    }
}