package org.enricogiurin.codingchallenges.codeforces.old.c1114;

import java.util.Scanner;

public class ProblemA {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int d = scanner.nextInt();
        int m = scanner.nextInt();

        int g = scanner.nextInt();
        int p = scanner.nextInt();
        int b = scanner.nextInt();

        if ((g - a) < 0) {
            System.out.println("NO");
            return;
        }
        g -= a;
        if ((g + p) < d) {
            System.out.println("NO");
            return;
        }
        int gPrev = g;
        g = Math.max(0, g - d);
        d -= gPrev - g;
        if (d > 0) {
            p -= d;
        }
        if ((g + p + b) >= m) {
            System.out.println("YES");
        } else {
            System.out.println("NO");
        }

    }
}
