## Comparing Combinations

Points: 7 (partial)
Time limit: 2.0s
Memory limit: 256M

Author:
Problem type

You really like combinatorics, especially with really big numbers! One day, you see a few queries on Stack Overflow.

Each query is in the following form: given four integers , determine whether .

Given your interest in the subject, you can't help but answer them!

#### Input Specification

The first line contains two integers: and .

The next lines each contain four integers: and .

#### Output Specification

Print lines.

For the line, print YES if , otherwise NO.

#### Sample Input

200000 5
2 1 5 3
6 4 15 1
30 5 23 18
182935 35439 114354 69801
196004 98092 199416 97732

#### Sample Output

YES
NO
NO
NO
YES

#### Explaination for Sample Output

In the first query, and . In this case, the left hand side is strictly less than the right hand side (), so the answer is YES.

In the second query, is not strictly less than , so the answer is NO.

In the third query, is false.