#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int sgn(const int x) {
  if (x > 0) return 1;
  if (x < 0) return -1;
  return 0;
}

bool solve() {
  ll x1, y1, x2, y2, X1, Y1, X2, Y2; cin >> x1 >> y1 >> x2 >> y2 >> X1 >> Y1 >> X2 >> Y2;
  if (x1 == X1 && y1 == Y1 && x2 == X2 && y2 == Y2) return true;
  if ((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1) <= (X2 - X1) * (X2 - X1) + (Y2 - Y1) * (Y2 - Y1)) return false;
  if (x1 == x2) return X1 == X2;
  return sgn(x2 - x1) == sgn(X2 - X1) && (y2 - y1) * (X2 - X1) == (Y2 - Y1) * (x2 - x1);
}

int main() {
  int t; cin >> t;
  while (t--) cout << (solve() ? "Yes\n" : "No\n");
  return 0;
}