21613_Download

Merlin wants to download a lot of files. But the network is so complex that he can't judge whether he can download all of the files in given time. So he wants you, the top coder of ZSU, to help him to judge whether he can download all of the files.

At first, Merlin wants to download n files from n different websites. Each website has its download limit. That means in every second, Merlin can download part of the file of band wide size or less. Besides that, the website has its own service time. That is to say, Merlin can begin download the file in the given time, otherwise the website will reject Merlin request. At last, Merlin's computer has its service limit what is that in every second, the computer can download the file using given band wide.

Because Merlin's computer is strong (compared of the network service), the time of combining the file can be ignore.

So, Can you help him?

he input will contain multiply test cases. In each test case, the fist line is three integers n, w and s ( 1 ≤ n ≤ 10, 1 ≤ s ≤ 100 ), n is the number of files to be download, w ( bit/s ) is the band wide of Merlin's computer and s is the limit second that Merlin can download all of the files.

And then there are n lines of integers, each line stands for one file. In each line, there are four integers a_i, b_i, c_i and d_i { 1 ≤ a_i, b_i ≤ 100000, 1 ≤ c_i ≤ d_i ≤ s ) That means the file can begin to download after the c_i second and must download before the d_i second (download included the c_i and d_i second), the size of file is a_i ( bit ) and the band wide of this file website is b_i ( bit/s ).

The Input will be terminated by n=0.

If Merlin can download all of the files in given second, print one line of "yes", otherwise print one line of "no".

3 100 4
100 50 1 2
100 50 2 3
100 100 4 4
3 100 4
100 50 1 2
100 50 2 3
100 100 3 3
0

yes
no