#include using namespace std; using ll = long long; using pll = pair; #define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i) #define rep(i, n) drep(i, 0, n - 1) #define all(a) (a).begin(), (a).end() #define pb push_back #define fi first #define se second mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count()); const ll MOD1000000007 = 1000000007; const ll MOD998244353 = 998244353; const ll MOD[3] = {999727999, 1070777777, 1000000007}; const ll LINF = 1LL << 60LL; const int IINF = (1 << 30) - 1; void solve(){ ll x1, y1, x2, y2, X1, Y1, X2, Y2; cin >> x1 >> y1 >> x2 >> y2 >> X1 >> Y1 >> X2 >> Y2; int state_x = 0, state_y = 0; if(x1-x2==0){ if(X1-X2==0){ state_x = 1; }else{ state_x = 0; } }else{ if(X1-X2==0){ state_x = 0; }else{ if(x1-x2<0){ swap(X1, X2); swap(x1, x2); } if(X1-X2<=0 || x1-x2<=X1-X2){ cout << "No\n"; return; }else{ state_x = 2; } } } if(y1-y2==0){ if(Y1-Y2==0){ state_y = 1; }else{ state_y = 0; } }else{ if(Y1-Y2==0){ state_y = 0; }else{ if(y1-y2<0){ swap(Y1, Y2); swap(y1, y2); } if(Y1-Y2<=0 || y1-y2<=Y1-Y2){ cout << "No\n"; return; }else{ state_y = 2; } } } if(state_x==0||state_y==0){ cout << "No\n"; return; } if(state_x==1||state_y==1){ cout << "Yes\n"; return; } if((X1-X2)*(y1-y2)==(Y1-Y2)*(x1-x2)){ cout << "Yes\n"; }else{ cout << "No\n"; } } int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); int T=1; cin >> T; while(T--) solve(); }