#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
	ll ax, ay, bx, by, cx, cy;
	cin >> ax >> ay >> bx >> by >> cx >> cy;
	ll dx = ax * bx - ay * by, dy = ay * bx + by * ax;
	ll g = gcd(abs(dx), abs(dy));
	// dx /= g; dy /= g;
	if (dy && dx) cout << ((dx * cy == dy * cx) ? "Yes" : "No") << endl;
	else {
		if (dy < 0) {
			dx *= -1; dy *= -1;
		}
		cout << (((dx < 0) == (cx < 0)) && ((dy < 0) == (cy < 0)) && ((dx * cy == dy * cx)) ? "Yes" : "No") << endl;
	}
}
int main () {
	int T;
	cin >> T;
	while (T--) solve();
}