#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//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; }
const double EPS = 1e-10;
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		long long ax, ay, bx, by, cx, cy;
		cin >> ax >> ay >> bx >> by >> cx >> cy;
		long long x = cy * (ax * bx - ay * by);
		long long y = cx * (ay * bx + ax * by);
		auto ta = ax == 0 ? atan(std::numeric_limits<double>::infinity()) : atan(ay / ax);
		auto tb = bx == 0 ? atan(std::numeric_limits<double>::infinity()) : atan(by / bx);
		auto tc = cx == 0 ? atan(std::numeric_limits<double>::infinity()) : atan(cy / cx);
		if (ay == 0 && ax < 0)ta = acos(-1);
		if (by == 0 && bx < 0)tb = acos(-1);
		if (cy == 0 && cx < 0)tc = acos(-1);
		//cout << ta << endl;
		//cout << tb << endl;
		//cout << tc << endl;
		if (x == y) cout << "Yes" << endl;
		else cout << "No" << endl;
	}
	return 0;
}