#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a,bool upp=0){if(a) cout<<(upp?"YES\n":"Yes\n"); else cout<<(upp?"NO\n":"No\n");}
template<class T> void vec_out(vector<T> &p,int ty=0){
if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}



void solve();
// oddloop
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t=1;
    cin>>t;
    rep(i,0,t) solve();
}

void solve(){
    struct point{
        ll x;
        ll y;
    };
    auto sub=[&](point &a,point b) -> void {
        a.x-=b.x;
        a.y-=b.y;
    };
    auto rot=[&](point &a,point b) -> void {
        point c;
        c.x=a.x*b.x+a.y*b.y;
        c.y=a.y*b.x-a.x*b.y;
        a=c;
    };
    point P1,P2,Q1,Q2;
    cin>>P1.x>>P1.y>>P2.x>>P2.y>>Q1.x>>Q1.y>>Q2.x>>Q2.y;
    sub(P2,P1);
    sub(Q1,P1);
    sub(Q2,P1);
    sub(P1,P1);
    rot(Q1,P2);
    rot(Q2,P2);
    rot(P2,P2);
    if(P1.x==Q1.x&&P1.y==Q1.y&&P2.x==Q2.x&&P2.y==Q2.y){
        yneos(1);
        return;
    }
    sub(Q2,Q1);
    yneos(Q2.y==0&&0<Q2.x&&Q2.x<P2.x);
}