Problem:
Score : 100 points

Problem Statement

Takahashi is meeting up with Aoki.

They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.

Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.

Will he arrive in time?

Constraints

1 \leq D \leq 10000

1 \leq T \leq 10000

1 \leq S \leq 10000

All values in input are integers.

Input

Input is given from Standard Input in the following format:

D T S

Output

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

Sample Input 1

1000 15 80

Sample Output 1

Yes

It takes 12.5 minutes to go 1000 meters to the place at a speed of 80 meters per minute. They have planned to meet in 15 minutes so he will arrive in time.

Sample Input 2

2000 20 100

Sample Output 2

Yes

It takes 20 minutes to go 2000 meters to the place at a speed of 100 meters per minute. They have planned to meet in 20 minutes so he will arrive just on time.

Sample Input 3

10000 1 1

Sample Output 3

No

He will be late.

Solution in Ruby (2.7.1) (judge verdict: Runtime Error)

n,m = gets.strip.split.map(&:to_i)
ary = []
num = Array.new(n,0)
m.times do
  a,b = gets.stirp.split.map(&:to_i)
  unless ary.unshift([a,b].to_a).uniq.size == ary.size || ary.unshift([b,a].to_a).uniq.size == ary.size
    ary.unshift([a,b].to_a)
    ary.unshift([b,a].to_a)
    num[a-1] += 1
    num[b-1] += 1
end
puts num.max+1