100 atcoder#ABC191A. [ABC191A] Vanishing Pitch

[ABC191A] Vanishing Pitch

Score : 100100 points

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 Vm/sV \, \mathrm{m / 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 DmD \, \mathrm{m} away from Takahashi, Aoki can hit the ball. Otherwise, he cannot hit it. Can Aoki hit the ball?

Constraints

  • 1V10001 \le V \le 1000
  • 1T<S10001 \le T \lt S \le 1000
  • 1D10001 \le D \le 1000
  • 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.

10 3 5 20
Yes

The ball is exactly 20m20 \, \mathrm{m} 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.

10 3 5 30
No

Note that the ball is also invisible at TT seconds and SS seconds after throwing. Here, the ball is exactly DmD \, \mathrm{m} away from Takahashi at TT seconds after throwing, so the ball is invisible and cannot be hit by Aoki.