/* -*- coding: utf-8 -*-
 *
 * 2628.cc:  No.2628 Shrinkage - yukicoder
 */

#include<cstdio>
#include<algorithm>
 
using namespace std;

/* constant */

/* typedef */

typedef long long ll;

template <typename T>
struct Pt {
  T x, y;
  Pt() {}
  Pt(T _x, T _y) : x(_x), y(_y) {}
  Pt(const Pt<T> &p) : x(p.x), y(p.y) {}

  Pt<T> operator+(const Pt<T> p) const { return Pt<T>(x + p.x, y + p.y); }
  Pt<T> operator-() const { return Pt<T>(-x, -y); }
  Pt<T> operator-(const Pt<T> p) const { return Pt<T>(x - p.x, y - p.y); }
  Pt<T> operator*(T t) const { return Pt<T>(x * t, y * t); }
  Pt<T> operator/(T t) const { return Pt<T>(x / t, y / t); }
  T dot(Pt<T> v) const { return x * v.x + y * v.y; }
  T cross(Pt<T> v) const { return x * v.y - y * v.x; }
  T d2() { return x * x + y * y; }

  bool operator==(const Pt<T> pt) const { return x == pt.x && y == pt.y; }
  bool operator!=(const Pt<T> pt) const { return x != pt.x || y != pt.y; }
  bool operator<(const Pt<T> &pt) const {
    return x < pt.x || (x == pt.x && y < pt.y);
  }
};

typedef Pt<ll> pt;

/* global variables */

pt readpt() {
  ll x, y;
  scanf("%lld%lld", &x, &y);
  return pt(x, y);
}

/* subroutines */

/* main */

int main() {
  int tn;
  scanf("%d", &tn);

  while (tn--) {
    pt p0 = readpt(), p1 = readpt(), q0 = readpt(), q1 = readpt();

    if ((p0 == q0 && p1 == q1) ||
	((p1 - p0).cross(q1 - q0) == 0 &&
	 (p1 - p0).dot(q1 - q0) > 0 &&
	 (p1 - p0).d2() > (q1 - q0).d2()))
      puts("Yes");
    else
      puts("No");
  }

  return 0;
}