import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const numCases = readInt;
      foreach (caseId; 0 .. numCases) {
        long[4] X, Y;
        foreach (i; 0 .. 4) {
          X[i] = readLong;
          Y[i] = readLong;
        }
        
        const same = (X[0] == X[2] && Y[0] == Y[2] && X[1] == X[3] && Y[1] == Y[3]);
        X[1] -= X[0]; Y[1] -= Y[0];
        X[3] -= X[2]; Y[3] -= Y[2];
        const para = (X[1] * Y[3] - Y[1] * X[3] == 0);
        const shri = (X[1]^^2 + Y[1]^^2 > X[3]^^2 + Y[3]^^2);
        debug {
          writeln(same, " ", para, " ", shri);
        }
        const ans = same || (para && shri);
        writeln(ans ? "Yes" : "No");
      }
    }
  } catch (EOFException e) {
  }
}