#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint998244353;
//const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
struct Position {
	long long x, y;
	Position(long long x, long long y) :x(x), y(y) {}
	Position static read() {
		long long x, y; cin >> x >> y;
		return Position(x, y);
	}
	bool operator==(Position other) { return x == other.x && y == other.y; }
	long long dist(const Position & other) {
		long long ret = 0;
		long long dx = x - other.x;
		ret += dx * dx;
		long long dy = y - other.y;
		ret += dy * dy;
		return ret;
	}
	Position diff(const Position & other) {
		return Position(x - other.x, y - other.y);
	}
	void test() {
		long long g = gcd(x, y);
		cout << x / g << " " << y / g << endl;
	}
	bool solve(const Position & other) {
		if (x * other.y != y * other.x)return false;
		if (x > 0 && other.x < 0)return false;
		if (x < 0 && other.x > 0)return false;
		if (y> 0 && other.y < 0)return false;
		if (y < 0 && other.y > 0)return false;
		return true;
	}
};
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		auto p0 = Position::read();
		auto p1 = Position::read();
		auto q0 = Position::read();
		auto q1 = Position::read();
		if (p0 == q0 && p1 == q1) {
			cout << "Yes" << endl;
			continue;
		}
		long long dp = p0.dist(p1);
		long long dq = q0.dist(q1);
		if (dp <= dq) {
			cout << "No" << endl;
			continue;
		}
		auto diffp = p0.diff(p1);
		auto diffq = q0.diff(q1);
		if (diffp.solve(diffq))cout << "Yes" << endl;
		else cout << "No" << endl;
	}
	return 0;
}