#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)
#define PER(i, n) for(ll i=(ll)(n)-1; i>=0; i--)

template<typename T> int LB(const T& v, T x) { return lower_bound(ALL(v),x)-v.begin(); }
template<typename T> int UQ(T& v) { sort(ALL(v)); v.erase(unique(ALL(v)),v.end()); return v.size(); }
template<typename T> bool chmax(T &a, T b) { return a<b ? a=b, true : false; }
template<typename T> bool chmin(T &a, T b) { return a>b ? a=b, true : false; }
template<typename T> using rpriority_queue = priority_queue<T,vector<T>,greater<T>>;
using ll=long long; const int INF=1e9+10; const ll INFL=4e18;
using ld=long double; using lll=__int128_t; using ull=unsigned long long;
using VI=vector<int>; using VVI=vector<VI>; using VL=vector<ll>; using VVL=vector<VL>;
using PL=pair<ll,ll>; using VP=vector<PL>; using WG=vector<vector<pair<int,ll>>>;


#ifdef LOCAL
#include "./debug.hpp"
#else
#define debug(...)
#define print_line
#endif


//----------------------------------------------------------

void solve() {
    VL X(3),Y(3);
    REP(i,3) cin>>X[i]>>Y[i];

    ld A=X[0]==0 ? numbers::pi*0.5 : atan2(Y[0],X[0]);
    ld B=X[1]==0 ? numbers::pi*0.5 : atan2(Y[1],X[1]);
    ld C=X[2]==0 ? numbers::pi*0.5 : 
        Y[2]==0 && X[2]<0 ? numbers::pi :
        atan2(Y[2],X[2]);

    A+=B;
    if(abs(A-C)<1e-9) cout<<"Yes"<<'\n';
    else cout<<"No"<<'\n';
}

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    //cout<<fixed<<setprecision(15);
    int T=1;
    cin>>T;
    while(T--) solve();
}