A. Fitting boxes
time limit per test
0.25 seconds
memory limit per test
64 megabytes
input
standard input
output
standard output

Programming is fun, but programmers usually don't like geometry problems, though they are often part of the programming competitions. Jonas participated in a programming competition yesterday and one of the problems that he hadn't solved was a geometry problem. Jonas is a very stubborn programmer, and he always works hard to solve the problems he didn't solve in a contest. Certainly, Jonas was able to solve the problem when he got home after a while, but let's see if you can do it better than Jonas today. In this problem you are given 2 rectangles and you need to find if you can fit one of them into the other. The dimensions (A1, B1), (A2, B2) of the rectangles are given. Rectangles can be rotated, if necessary, in order to fit them. The width of the sides of the rectangles is negligible. The rectangle inside can coincide with the outer rectangle sides, for example 1 x 1 rectangle fits inside 2 x 1.

Input

Each test case contains 4 positive integers separated by a space character, A1 ≤ 103, B1 ≤ 103, A2 ≤ 103, B2 ≤ 103.

Output

Output "Yes" if it's possible to fit one box into another, or "No" if it's not possible.

Examples
Input
4 4 4 4
Output
Yes
Input
20 1 1 10
Output
Yes
Input
10 10 5 16
Output
No
Input
10 10 11 1
Output
Yes
Input
100 100 200 1
Output
No