Home Web Board ProblemSet Standing Status Statistics
long long输出请使用 %lld服务器的python版本为3.4
Problem A: 五队-长春-Candies

Problem A: 五队-长春-Candies

Time Limit: 1 Sec  Memory Limit: 32 MB
Submit: 24  Solved: 20
[Submit][Status][Web Board]

Description

Little Dingding has a lot of candies. In order to stop gaining weight, he decided to eat candies regularly. So every day he eats at least candies and at most candies.
Now he is going to eat candies for days, and he wants to know, whether there exists a plan, that he can eat exactly candies between day and day inclusive (i.e. , ).

Input

There are multiple test cases. Given ,,, as described before in one line. Process to end of file.

Output

If there exsits a plan satisfying the conditions, print “YES”, otherwise print “NO” (without the quotes)

Sample Input

5 1 1 2
5 3 4 5
5 3 4 19

Sample Output

YES
NO
YES

HINT

[Submit][Status][Web Board]