#include <bits/stdc++.h>

#include <atcoder/all>
#define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
using namespace std;
using namespace atcoder;

typedef long long ll;

ll dist(ll x1, ll y1, ll x2, ll y2) {
    return (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
}

void sol() {
    ll a, b, c, d, e, f, g, h;
    cin >> a >> b >> c >> d >> e >> f >> g >> h;
    if (a == e && b == f && c == g && d == h) {
        cout << "Yes" << endl;
        return;
    }
    if (a == e && b == f) {
        cout << "No" << endl;
        return;
    }
    if (c == g && d == h) {
        cout << "No" << endl;
        return;
    }
    ll px = a - c;
    ll py = b - d;
    ll qx = e - g;
    ll qy = f - h;
    // pベクトルとqベクトルが平行ならtrue
    bool tmp = (px * qy == py * qx);
    // 向きが逆ならfalse
    if (px * qx < 0 || py * qy < 0) {
        tmp = false;
    }
    if (dist(a, b, c, d) > dist(e, f, g, h) && tmp) {
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }
}

int main() {
    int t;
    cin >> t;
    rep(i, 0, t) { sol(); }
    return 0;
}