Problem2366--Don't be late

2366: Don't be late

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

Description

Time Limit: 2 sec / Memory Limit: 1024 MB

Score : 100100 points

Problem Statement

Takahashi is meeting up with Aoki.
They have planned to meet at a place that is DD meters away from Takahashi's house in TT minutes from now.
Takahashi will leave his house now and go straight to the place at a speed of SS meters per minute.
Will he arrive in time?

Constraints

  • 1 \leq D \leq 100001D10000
  • 1 \leq T \leq 100001T10000
  • 1 \leq S \leq 100001S10000
  • All values in input are integers.

Input

Input is given from Standard Input in the following format:
DDTTSS

Output

If Takahashi will reach the place in time, print Yes; otherwise, print No.

Sample Input Copy

1000 15 80

Sample Output Copy

Yes

HINT

It takes 12.512.5 minutes to go 10001000 meters to the place at a speed of 8080 meters per minute. They have planned to meet in 1515 minutes so he will arrive in time.

Source/Category