x1, y1, x2, y2 = map(int, input().split())
x3, y3, x4, y4 = map(int, input().split())
x5, y5, x6, y6 = map(int, input().split())
if x1 >= x3 and y1 >= y3 and x2 <= x4 and y2 <= y4:
print('NO')
exit()
elif x1 >= x3 and y1 >= y3 and x2 > x4 and y2 <= y4:
x1 = max(x4, x1)
elif x1 < x3 and y1 >= y3 and x2 <= x4 and y2 <= y4:
x2 = min(x3, x2)
elif x1 >= x3 and y1 < y3 and x2 <= x4 and y2 <= y4:
y2 = min(y3, y2)
elif x1 >= x3 and y1 >= y3 and x2 <= x4 and y2 > y4:
y1 = max(y4, y1)
if x1 >= x5 and y1 >= y5 and x2 <= x6 and y2 <= y6:
print("NO")
else:
print("YES")
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 |
XOREQN Xor Equation | MAKEPAL Weird Palindrome Making |
HILLSEQ Hill Sequence | MAXBRIDGE Maximise the bridges |
WLDRPL Wildcard Replacement | 1221. Split a String in Balanced Strings |
1002. Find Common Characters | 1602A - Two Subsequences |