gym100971G



Alex is repairing his country house. He has a rectangular metal sheet of size a × b. He has to cut two rectangular sheets of sizes a₁ × b₁ and a₂ × b₂ from it. All cuts must be parallel to the sides of the initial sheet. Determine if he can do it.

Input

The first line contains two space-separated integers a and b (1 ≤ a, b ≤ 10⁹) — the sizes of the initial sheet.

The second line contains two space-separated integers a₁ and b₁ (1 ≤ a₁, b₁ ≤ 10⁹) — the sizes of the first sheet to cut out.

The third line contains two space-separated integers a₂ and b₂ (1 ≤ a₂, b₂ ≤ 10⁹) — the sizes of the second sheet to cut out.

Output

Output «YES» (without quotes), if it's possible to cut two described sheets from the initial sheet, or «NO» (without quotes), if it's not possible.

Example

Input

12 20
14 7
5 6

Output

YES

Input

12 20
11 9
20 7

Output

NO

给你三个矩形，问你都一个能不能包含2，3个

就那几种情况枚举就好了

ac代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int main()
{
    int flag;
    long long a,b,c,d,e,f;
    while(cin>>a>>b>>c>>d>>e>>f)
    {
        flag=0;
        if(a>b)
        {
            int t=a;a=b;b=t;
        }
        if(c>d)
        {
            int t=c;c=d;d=t;
        }
        if(e>f)
        {
            int t=e;e=f;f=t;
        }
        if(c+e<=a&&max(d,f)<=b)
        flag=1;
        if(c+e<=b&&max(d,f)<=a)
        flag=1;
        if(c+f<=b&&max(d,e)<=a)
        flag=1;
        if(d+e<=b&&max(c,f)<=a)
        flag=1;
        if(d+f<=b&&max(c,e)<=a)
        flag=1;
        if(flag==1)
        printf("YES\n");
        else
        printf("NO\n");
    }
    return 0;
}