#include <bits/stdc++.h>
const long long INF = LLONG_MAX;
const long long MOD = 1e9 + 9;
using namespace std;
long long prime(long long x) {
  bool flag = 1;
  for (long long i = 2; i * i <= x; i++) {
    if (x % i == 0) {
      flag = 0;
      break;
    }
  }
  return flag;
}
long long gcd(long long r, long long b) {
  long long x = 1;
  while (b != 0) {
    x = b;
    b = r % b;
    r = x;
  }
  return x;
}
void fastio() {}
void solve() {
  long long a, b, c, d;
  cin >> a >> b >> c >> d;
  if ((a + c == b && b == d) || (a + d == b && b == c) ||
      (b + c == a && a == d) || (b + d == a && a == c)) {
    cout << "Yes";
  } else {
    cout << "No";
  }
  cout << endl;
  return;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
