Gold ingot

Limits: 2 sec., 256 MiB

This statement was translated automatically from Ukrainian.

Zenyk managed to steal a golden rectangular parallelepiped from the National Bank of Ukraine. After that, he decided that it was time to run away with the gold, and started packing a suitcase, which is also a rectangular parallelepiped.

He wondered if he could put the ingot into the suitcase so that they share a common corner.

Input

The first line contains three integers \(a_i\) — the lengths of the edges of the golden parallelepiped.

The second line contains three integers \(b_i\) — the lengths of the edges of the suitcase.

Output

In a single line, print Yes if the golden parallelepiped can fit into the suitcase, and No otherwise.

Constraints

\(1 \le a_i, b_i \le 10^3\).

Samples