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

#define rep(i,n) for(ll i=0;i<n;++i)
#define all(a) (a).begin(),(a).end()
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
template<class T> T div_floor(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); }
template<class T> T div_ceil(T a, T b) { return a / b + ((a ^ b) > 0 && a % b); }
template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &a){
    if (a.empty()) return os;
    os << a.front();
    for (auto e : a | views::drop(1)){
        os << ' ' << e;
    }
    return os;
}

void dump(auto ...vs){
    ((cout << vs << ' '), ...) << endl;
}

pair<ll,ll> operator+(pair<ll,ll> a,pair<ll,ll> b){
    return {a.first+b.first,a.second+b.second};
}
pair<ll,ll> operator-(pair<ll,ll> a,pair<ll,ll> b){
    return {a.first-b.first,a.second-b.second};
}

ll cross(pair<ll,ll> a,pair<ll,ll> b){
    return a.first*b.second-a.second*b.first;
}

ll dot(pair<ll,ll> a,pair<ll,ll> b){
    return a.first*b.first+a.second*b.second;
}

ll len2(pair<ll,ll> a){
    return a.first*a.first+a.second*a.second;
}

bool operator==(pair<ll,ll> a,pair<ll,ll> b){
    return (a.first==b.first)&&(a.second==b.second); 
}

void solve() {
    pair<ll,ll> p1,p2,q1,q2;
    auto input=[](pair<ll,ll> &a){
        cin>>a.first>>a.second;
    };
    input(p1);
    input(p2);
    input(q1);
    input(q2);
    if(q1==p1 and q2==p2){
        cout<<"Yes"<<'\n';
        return;
    }
    pair<ll,ll> pv=p2-p1;
    pair<ll,ll> qv=q2-q1;
    if (len2(pv)==0){
        if (len2(qv)==0){
            cout<<"Yes"<<'\n';
            return;
        }
        else{
            cout<<"No"<<'\n';
            return;
        }
    }
    if (len2(qv)==0){
        cout<<"No"<<'\n';
        return;
    }
    if (len2(pv)<=len2(qv)){
        cout<<"No"<<'\n';
        return;
    }
    if (cross(pv,qv)!=0){
        cout<<"No"<<'\n';
        return;
    }
    if (dot(pv,qv)>=0){
        cout<<"Yes"<<'\n';
    }
    else{
        cout<<"No"<<'\n';
    }
    return;
}


int main() {
    ll T=1;
    cin>>T;
    while (T--){
        solve();
    }
    return 0;
}