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 JavaScript (Node.js 12.16.1) (judge verdict: Accepted)

function Main(input) {
	input = input.trim().split("\n").map(function(x) { return x.split(" ")});
	let D = parseInt(input[0][0], 10);
	let T = parseInt(input[0][1], 10);
	let S = parseInt(input[0][2], 10);
	if (D / S <= T) console.log('Yes');
	else console.log('No');


}

Main(require("fs").readFileSync("/dev/stdin", "utf8"));