R=lambda:sorted(map(int,input().split()))
t,=R()
for _ in[0]*t:a,b=R();c,d=R();print('NYOE S'[b==d==a+c::2])#include<iostream>
int main() {
int t;
std::cin >> t;
while (t--) {
int a, b, c, d;
std::cin >> a >> b >> c >> d;
if (a > b)
std::swap(a, b);
if (c > d)
std::swap(c, d);
if (a + c == b && b == d)
std::cout << "YES" << std::endl;
else std::cout << "NO" << std::endl;
}
}566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |
112. Path Sum | 1556A - A Variety of Operations |
136. Single Number | 169. Majority Element |
119. Pascal's Triangle II | 409. Longest Palindrome |
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |
1607A - Linear Keyboard | EQUALCOIN Equal Coins |