//
// Created by Oision on 2022/2/25.
//
// UVA839 天平 Not so Mobile
// 经典递归
#include <bits/stdc++.h>
using namespace std;
bool solve(int &w) {
int l, r, lw, rw;
bool ll = true, rr = true;
cin >> l >> lw >> r >> rw;
if (l == 0) ll = solve(l);
if (r == 0) rr = solve(r);
w = l + r;
return ll && rr && (l * lw == r * rw);
}
int main() {
// Node *n;
int T, w;
cin >> T;
while (T--) {
if (solve(w)) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
if (T) {
cout << endl;
}
}
}