**Problem**

Given seven integers: N, A0, B0, L0, A1, B1, L1, you are to design a 01 string S = s1 s2 ... si ... sN, satisfying the following constraints:

- si = 0 or si = 1, 1 <= i <= N;
- any consecutive substring of S with length of L0 contains no less than A0 zero(s) and no more than B0 zero(s).
- any consecutive substring of S with length of L1 contains no less than A1 one(s) and no more than B1 one(s).

For example, N = 6, A0 = 1, B0 = 2, L0 = 3, A1 = 1, B1 = 1, L1 = 2, the string S = 010101 satisfies all constraints above.

**Input**

You need to process several test cases. Each test case contains seven integers in a line: N, A0, B0, L0, A1, B1, L1(3 <= N <= 1000, 1 <= A0 <= B0 <= L0 <= N, 1 <= A1 <= B1 <= L1 <= N), consecutive numbers are separated by a space.

**Output**

For each test case, if it is possible to design such a string print a "Yes" in a single line, otherwise print a "No".

**Sample Input**

6 1 2 3 1 1 2

**Sample Output**

Yes

Source: *NOI99*