Problem2186--Vanishing Pitch (abc191a)

2186: Vanishing Pitch (abc191a)

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 128 MB

Description

Problem Statement

Takahashi and Aoki are playing baseball. Takahashi is the pitcher, and Aoki is the batter.
Takahashi can throw an invisible pitch. When he throws it, the ball moves linearly at a constant speed V \, \mathrm{m / s}Vm/s, and it becomes invisible between the moment TT seconds after throwing and the moment SS seconds after throwing (inclusive). The ball keeps moving when it is invisible.
If the ball is not invisible at the moment the ball is exactly D \, \mathrm{m}Dm away from Takahashi, Aoki can hit the ball. Otherwise, he cannot hit it. Can Aoki hit the ball?

Constraints

  • 1 \le V \le 10001V1000
  • 1 \le T \lt S \le 10001T<S1000
  • 1 \le D \le 10001D1000
  • All values in input are integers.

Input

Input is given from Standard Input in the following format:
VV TT SS DD

Output

If Aoki can hit the ball, print Yes; otherwise, print No.

Sample Input Copy

10 3 5 20

Sample Output Copy

Yes

HINT

The ball is exactly 20 \, \mathrm{m}20m away from Takahashi at 22 seconds after throwing.
On the other hand, the ball becomes invisible between 33 and 55 seconds (inclusive) after throwing, so Aoki can hit the ball.

Source/Category