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 100001≤D≤10000
-
1 \leq T \leq 100001≤T≤10000
-
1 \leq S \leq 100001≤S≤10000
-
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.