#include <bits/stdc++.h>
using namespace std;
using ll = long long;

struct point{
    ll x, y;
    bool operator==(const point &a){
        return (x == a.x) && (y == a.y);
    }
};
point P[2];
point Q[2];
ll dist(point a, point b){
    return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y);
}
bool heikou(){
    point p = {P[0].x - P[1].x, P[0].y - P[1].y};
    point q = {Q[0].x - Q[1].x, Q[0].y - Q[1].y};
    if(p.x == 0 && q.x == 0)return p.y * q.y > 0;
    if(p.y == 0 && q.y == 0)return p.x * q.x > 0;
    return (p.x * q.y == p.y * q.x);
}
void solve(){
    cin >> P[0].x >> P[0].y;
    cin >> P[1].x >> P[1].y;
    cin >> Q[0].x >> Q[0].y;
    cin >> Q[1].x >> Q[1].y;
    if(P[0] == Q[0] && P[1] == Q[1]){
        cout << "Yes\n";
        return;
    }
    bool f = (dist(P[0], P[1]) > dist(Q[0], Q[1])) && heikou();
    cout << (f ? "Yes\n" : "No\n");
}
int main(void){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t; cin >> t;
    while(t--)solve();
    return 0;
}