/* #region Head */

// #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert> // assert.h
#include <cmath>   // math.h
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define TREP(T, i, m, n) for (T i = (m), i##_len = (T)(n); i < i##_len; ++(i))
#define TREPM(T, i, m, n) for (T i = (m), i##_max = (T)(n); i <= i##_max; ++(i))
#define TREPR(T, i, m, n) for (T i = (m), i##_min = (T)(n); i >= i##_min; --(i))
#define TREPD(T, i, m, n, d) for (T i = (m), i##_len = (T)(n); i < i##_len; i += (d))
#define TREPMD(T, i, m, n, d) for (T i = (m), i##_max = (T)(n); i <= i##_max; i += (d))

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define ISIZE(x) ((int)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))

#define endl '\n'

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力
    REP(i, 0, SIZE(arr)) is >> arr[i];
    return is;
}
template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr) { // array 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, const T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) {
    return out_iter(os, map_var);
}
template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

// tuple 出力
template <size_t N = 0, bool end_line = false, typename... Args> ostream &operator<<(ostream &os, tuple<Args...> &a) {
    if constexpr (N < std::tuple_size_v<tuple<Args...>>) {
        os << get<N>(a);
        if constexpr (N + 1 < std::tuple_size_v<tuple<Args...>>) {
            os << ' ';
        } else if constexpr (end_line) {
            os << '\n';
        }
        return operator<< <N + 1, end_line>(os, a);
    }
    return os;
}
template <typename... Args> void print_tuple(tuple<Args...> &a) { operator<< <0, true>(std::cout, a); }

void pprint() { std::cout << endl; }
template <class Head, class... Tail> void pprint(Head &&head, Tail &&...tail) {
    std::cout << head;
    if (sizeof...(Tail) > 0) std::cout << ' ';
    pprint(move(tail)...);
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&...tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#ifndef ONLINE_JUDGE
#define DEBUG_
#endif

#ifndef MYLOCAL
#undef DEBUG_
#endif

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

#define VAR(type, ...)                                                                                                 \
    type __VA_ARGS__;                                                                                                  \
    assert((std::cin >> __VA_ARGS__));

template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }
template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), std::cin.tie(nullptr), std::cout.tie(nullptr);
        std::cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) std::cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { std::cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { std::cout << (p ? "YES" : "NO") << endl; }

template <typename T> constexpr void operator--(vc<T> &v, int) noexcept {
    for (int i = 0; i < ISIZE(v); ++i) v[i]--;
}
template <typename T> constexpr void operator++(vc<T> &v, int) noexcept {
    for (int i = 0; i < ISIZE(v); ++i) v[i]++;
}

/* #endregion */

// #include <atcoder/all>
// using namespace atcoder;

/* #region IntGeometry */

// template <typename T = ll>
struct P {
    using T = ll;
    T x, y;

    P() : x(0), y(0) {}
    P(const T x, const T y) : x(x), y(y) {}
    T real() const { return x; }
    T imag() const { return y; }
    P &operator+=(const P &a) {
        x += a.x;
        y += a.y;
        return *this;
    }
    P &operator-=(const P &a) {
        x -= a.x;
        y -= a.y;
        return *this;
    }
    P operator+(const P &a) const {
        P res(*this);
        return res += a;
    }
    P operator-(const P &a) const {
        P res(*this);
        return res -= a;
    }
    // norm の自乗を返す
    friend T norm2(const P &a) { return a.x * a.x + a.y * a.y; }
    // norm を返す
    friend ld norm(const P &a) { return sqrtl(a.x * a.x + a.y * a.y); }

    // 外積（の大きさ）を求める
    friend T cross(const P &a, const P &b) { return a.real() * b.imag() - a.imag() * b.real(); }
    // 内積を求める
    friend T dot(const P &a, const P &b) { return a.real() * b.real() + a.imag() * b.imag(); }

    // 偏角を求める．ただし 0 の偏角は求められない．
    // [-π, π] の範囲で返す．
    ld arg() const {
        assert(x != 0 || y != 0);
        return atan2<ld, ld>(y, x);
    }
    // base 方向を基準にした a の方向（a/base の偏角）を求める．
    // [-π, π] の範囲で返す．
    friend ld arg(const P &a, const P &base) {
        ld ans = a.arg() - base.arg();
        if (ans > PI) {
            ans -= PI * 2;
        }
        if (ans <= -PI) ans += PI * 2;
        return ans;
    }

    // 出力
    friend ostream &operator<<(ostream &os, const P a) {
        os << '(' << a.x << ", " << a.y << ')';
        return os;
    }

    // 象限を返す（偏角ソート用）
    int area_id() const {
        if (y < 0) {
            if (x > 0) return 4;
            return 3;
        }
        if (x < 0) return 2;
        return 1;
    }
    friend bool operator<(const P &p, const P &q) {
        const int ap = p.area_id();
        const int aq = q.area_id();
        if (ap != aq) {
            return ap < aq;
        }

        auto [px, py] = p;
        auto [qx, qy] = q;
        const T z = py * qx - qy * px;
        // p<q
        //  <=> py/px < qy/qx (px, qx は同符号)
        //  <=> py*qx < qy*px
        //  <=> py*qx - qy*px < 0
        // return (z < 0);
        if (z != 0) return z < 0;
        return norm(p) < norm(q);
    }
    friend bool operator==(const P &left, const P &right) { return (left.x == right.x && left.y == right.y); }
    friend bool operator!=(const P &left, const P &right) { return !(left == right); }
    // 傾きが等しいかどうか
    bool r_eq(const P &another) const {
        // y/x == a.y/a.x
        return y * another.x == another.y * x;
    }
    // 偏角ソート用に r_eq を使用する
    // （傾きが等しい場合も座標としては等しくないので，left==rightとは書かないで r_eq() を使う）
    friend bool operator<=(const P &left, const P &right) { return ((left < right) || left.r_eq(right)); }
};

// using P = complex<ll>; // 2次元平面上の点
// using G = vc<P>;

/*
                    CCW

 -- BEHIND -- [a -- ON -- b] --- FRONT --

                    CW
 */
// CCW (Counter Clock Wise) 結果列挙体
enum CCW_RESULT {
    CCW = +1,    // 反時計回り
    CW = -1,     // 時計回り
    BEHIND = +2, // 広報
    FRONT = -2,  // 前方
    ON = 0       // 2点間
};

// ベクトル A→B を基準に，点 C がどの方向にあるか（反時計回りかどうか）を調べる．
// 反時計回り ― 延長線上 ― 時計回り，で 1, 0, -1 を返す．
CCW_RESULT ccw(P a, P b, P c) {
    b -= a;
    c -= a;
    if (cross(b, c) > 0) return CCW;     // counter clockwise
    if (cross(b, c) < 0) return CW;      // clockwise
    if (dot(b, c) < 0) return BEHIND;    // c--a--b on line
    if (norm(b) < norm(c)) return FRONT; // a--b--c on line
    return ON;
}

/* #endregion */

// Problem
void solve() {
    VAR(ll, t);
    REP(_case, 0, t) {
        VAR(ll, x1, y1, x2, y2, X1, Y1, X2, Y2); //
        P p1(x1, y1);
        P p2(x2, y2);
        P q1(X1, Y1);
        P q2(X2, Y2);

        // 最初から一致している場合
        if (p1 == q1 && p2 == q2) {
            Yn(true);
            continue;
        }

        // q1==q2 の場合
        if (q1 == q2) {
            Yn(false);
            return;
        }

        // 拡大する場合
        P dp = p2 - p1;
        P dq = q2 - q1;
        if (norm2(dp) <= norm2(dq)) {
            Yn(false);
            continue;
        }

        // 平行でない場合 No
        if (dp.x * dq.y != dq.x * dp.y) {
            Yn(false);
        }

        // 順序が入れ替わらない場合 Yes
        // (dx, dy がそれぞれ同符号)
        Yn(dp.x * dq.x >= 0 && dp.y * dq.y >= 0);
    }
}

// entry point
int main() {
    solve();
    return 0;
}