#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
using ll=long long;
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

ll dist(ll x,ll y){return x*x+y*y;}

void solve(){
    vector<ll>X(4),Y(4);
    for(int i=0;i<4;i++){
        cin>>X[i]>>Y[i];
    }
    ll px=X[1]-X[0],py=Y[1]-Y[0];
    ll qx=X[3]-X[2],qy=Y[3]-Y[2];
    if(px*qy-qx*py!=0)cout<<"No"<<"\n";
    else{
        if(px*qx>=0&&py*qy>=0&&dist(px,py)>dist(qx,qy))cout<<"Yes"<<"\n";
        else cout<<"No"<<"\n";
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T;
    cin>>T;
    while(T--){
        solve();
    }
}