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 C (GCC 9.2.1) (judge verdict: Wrong Answer)

#include<stdio.h>
#include<stdlib.h>
#include<stdbool.h>
#include<math.h>
#include<string.h>

typedef long long ll;

int max(int a,int b){
	if(a<b)
		a=b;
	return a;	
}
int min(int a,int b){
	if(a>b)
		a=b;
	return a;	
}
void sorte(int n,int a[]){
	int i,j;
	
	for(i=0 ;i<n ; i++){
		for(j=0 ; j<n-1 ; j++){
			if(a[j]>a[j+1]){
				int tmp=a[j];
				a[j]=a[j+1];
				a[j+1]=tmp;
			}
		}
	}
}

void solve(){
 	int d,t,s;
 	scanf("%d%d%d",&d,&t,&s);
 
 	if((d/t)<=s)
 		printf("Yes\n");
 	else
	 	printf("No\n");	
}

int main(){
	 /*int t;
	 scanf("%d",&t);
	while(t--)*/
		solve();
	return 0;
}