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: Time Limit Exceeded)

#include <stdio.h>
#include <string.h>

int main(void) {
    int N;
    int mod = 1000000007;
    scanf("%d",&N);
    int A [N];
    for(int i=0;i<N;i++){
        scanf("%d",&A[i]);
    }
    
    int sub = 0;
    int zenbu = 0;
    int p = N-1;
    int X [N] ;
    

    
    while(p>=0){
        X[p] = A[p] % mod;
        p--;
}
     
    int q = N-1;
   
    while(q>=0){
        zenbu += X[q];
        zenbu %= mod;
        }
    
    for(int j= N-1;j>=1;j--){
        zenbu -=X[j];
        while(zenbu<0){zenbu += mod;}
              sub += X[j]*zenbu;
        while (sub<0){sub -= mod;}
        sub %= mod;
     }
    
    

    
    
    
   
    printf("%d",sub);
    
    
    return 0;
}