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.



Sample input:
1000 15 80


Sample output:
Yes

Submission status: Accepted

Solution code:

D, T, S = input().split()

if int(T)*int(S) < int(D):
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
D, T, S = map(int, input().split())

if D <= T * S:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
D, T, S = map(int,input().split())
a = D / S
if a <=T:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
#-*- Coding: utf-8 -*-

D, T, S = map(int, input().split())

if T*S >= D:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
d,t,s = [int(x) for x in input().split()]
if d/s <= t:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
D , T , S = map(int,input().split())

a = D / S

if a <= T:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

if T*S >= D:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
def main():
    d, t, s = map(int, input().split())
    print("Yes" if d / s <= t else "No") 


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def main(d: int, t: int, s: int):
    if d <= t*s:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    d, t, s = map(int, input().split())
    main(d, t, s)

Submission status: Accepted

Solution code:
d,t,s=(int(x) for x in input().split())
if d<=t*s:
  print("Yes")
else :
  print("No")

Submission status: Accepted

Solution code:
d,t,s=(int(x) for x in input().split())
if d<=t*s:
    print("Yes")
else :
    print("No")

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

print('Yes' if T * S >= D else 'No')

Submission status: Accepted

Solution code:
d,t,s=map(int, input().split())
if d <= s*t:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

if S*T >= D:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import math
a,b,c=[int(i) for i in input().split()]
e=math.ceil(a/c)
if(e<=b):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
# coding: utf-8
def main():
	d,t,s = map(int, input().split())
	if t-(d/s) >= 0:
		print('Yes')
	else:
		print('No')


if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
D, T, S = list(map(int, input().split()))
if (D / S) <= T:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
list1 = input().split(" ")
if int(list1[0]) <= int(list1[1]) * int(list1[2]):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
import itertools
import queue
from collections import deque
from fractions import Fraction




def main():
    a, b , c = map(int, input().split())
    if a / c <= b:
        print("Yes")
    else:
        print("No")



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
D ,T ,S =map(int ,input().split())
if T >= D/S :
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
d,t,s=map(int,input().split())
if((d/s)<=t):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

if D > T * S:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
d,t,s = map(int, input().split())
if d/s <= t:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())
print('Yes') if S*T >= D else print('No')

Submission status: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.read()
    data = list(map(int, input.split()))

    a, b, c = data

    if b*c >= a:
        print('Yes')
    else:
        print('No')



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline
D,T,S = map(int,input().split())

if(D/S <= T):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict as dd
from collections import deque
from functools import *
from fractions import Fraction as f
from copy import *
from bisect import *	
from heapq import *
from math import *
from itertools import permutations ,product
 
def eprint(*args):
    print(*args, file=sys.stderr)
zz=1
 
#sys.setrecursionlimit(10**6)
if zz:
	input=sys.stdin.readline
else:	
	sys.stdin=open('input.txt', 'r')
	sys.stdout=open('all.txt','w')
def inc(d,c):
	d[c]=d[c]+1 if c in d else 1
def bo(i):
	return ord(i)-ord('A')	
def li():
	return [int(xx) for xx in input().split()]
def fli():
	return [float(x) for x in input().split()]	
def comp(a,b):
	if(a>b):
		return 2
	return 2 if a==b else 0		
def gi():	
	return [xx for xx in input().split()]
def fi():
	return int(input())
def pro(a): 
	return reduce(lambda a,b:a*b,a)		
def swap(a,i,j): 
	a[i],a[j]=a[j],a[i]	
def si():
	return list(input().rstrip())	
def mi():
	return 	map(int,input().split())			
def gh():
	sys.stdout.flush()
def isvalid(i,j):
	return 0<=i<n and 0<=j<n	
def bo(i):
	return ord(i)-ord('a')	
def graph(n,m):
	for i in range(m):
		x,y=mi()
		a[x].append(y)
		a[y].append(x)


t=1

while t>0:
	t-=1
	d,tt,s=mi()
	print(["Yes","No"][int(d/s<=tt)^1])

Submission status: Accepted

Solution code:
d,t,s=map(int,input().split())
if(d<=t*s): print("Yes")
else: print("No")

Submission status: Accepted

Solution code:
D,T,S = map(int,input().split())

if D <= S*T:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())

if d / s <= t:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
D, T, S = input().split()
sum_price = int(T) * int(S)
if int(D) <= sum_price:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

if D/S <= T:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
D,V,T = map(int,input().split())
time = D / V
if time <= T:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
try:
    D,T,S = [int(e) for e in input().split()]
except:
    print('Error')
else:
    tmp = T * S
    if D > tmp:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

Solution code:
# cording:utf-8

# 3つの正数を入力
D, T, S = map(int, input().split())

# 間に合えば
if (D / S) <= T:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
n, t, s = map(int, input().split())

if (n/s) <= t:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
D,T,S=map(int,input().split())

if (D/S)<=T:print("Yes")
else : print("No")

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
if d <= s*t:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
D,T,S= map(int, input().split())
if D/S<=T:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n=input()
n=n.split()
d,t,s=int(n[0]),int(n[1]),int(n[2])
if s>=(d/t):
    print("Yes")
else: 
    print("No")

Submission status: Accepted

Solution code:
D,T,S = map(int,input().split())
if S*T < D :
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
D,T,S = map(int,input().split())
if D / S > T:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())
if t*s >=d:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
print('Yes' if d <= t * s else 'No')

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if a/c<=b:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())
if d > s*t:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
# Dは距離　Tは制限時間　速度はS
Information_Lists = input().split()
#.split("文字列")で、文字列ごとに分けることができる。"文字列"を入れないとスペースで分けられる。
D = int(Information_Lists[0])
T = int(Information_Lists[1])
S = int(Information_Lists[2])
if D > T * S:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
def main():
    d, t, s = map(int, input().split())

    print('Yes' if t*s >= d else 'No')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

if D / S <= T:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

if D/S <= T:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
D, T, S = tuple(int(x) for x in input().split())
if S*T >= D:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())

if d <= s * t:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    d, t, s = map(int,input().split())
    if d>s*t:
        print("No")
    else:
        print("Yes")

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())
if d/s <= t:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
input_data  = list(map(int,input().split()))
time = input_data[0]  /  input_data[2]
if time > input_data[1]:
	print('No')
else:
	print('Yes')

Submission status: Accepted

Solution code:
#import torch
class solution(object):

    def __init__(self, D: int, T: int, S: int)-> None:
        self.D = D
        self.T = T
        self.S = S
    
    def solve(self)->bool:
        return ['No','Yes'][(self.D/self.S) <= self.T]
    
if __name__=='__main__':
    # x = int(input())
    D,T,S= map( int , input().split())
    problem = solution(D, T, S)
    ans = problem.solve()
    print(ans)

Submission status: Accepted

Solution code:
D,T,S = map(int, input().split())
if D/S<=T:
	print('Yes')
else:
	print('No')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


def main():
    import sys
    input = sys.stdin.readline

    d, t, s = map(int, input().split())

    if s * t >= d:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
D,T,S=list(map(int,input().split()))
print("Yes" if D/S<=T else "No")

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())
if d/s <= t :
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
D,T,S=map(int,input().split())
if D/S<=T:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
from sys import stdin
input = stdin.readline

D, T, S = map(int, input().split())

if D <= T*S:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if(a/c<=b):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
D,T,S = map(int,input().split())


if D <= T*S:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
d,t,s=list(map(int,input().split(" ")))
if(d<=t*s):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

if D/S <= T : print("Yes")
else: print("No")

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())

if d / s > t:
    ans = "No"
    
else:
    ans = "Yes"
print(ans)

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))

if a[0]/a[2] <= a[1]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
D, T, S = [int(x) for x in input().split()]
print("Yes" if D <= (T * S) else "No")

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())
print('Yes' if S*T>=D else 'No')

Submission status: Accepted

Solution code:
D, T, S = input().split()
D = int(D)
T = int(T)
S = int(S)
if D <= (T*S):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())

if d > s*t:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
D,T,S = map(int,input().split())
if(D/S<=T):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
if t >= d/s:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
D,T,S=map(int,input().split())
if 1<=D<=10000 and 1<=T<=10000 and 1<=S<=10000:
  if (D/S)>T:
    print("No")
  else:
    print("Yes")

Submission status: Accepted

Solution code:
d, t, s = map ( int , input ().split())
if s >= d/t:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
lst = input()
lst = lst.strip().split()
D=int(lst[0])
T=int(lst[1])
S=int(lst[2])
print("Yes") if(D/S)<=T else print("No")

Submission status: Accepted

Solution code:
D, T, S = map(int,input().split())
print("Yes" if T*S >= D else "No")

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

print("Yes" if D / S <= T else "No")

Submission status: Accepted

Solution code:
d,t,s=map(int,input().split())
print('Yes'if d/s<=t else'No')

Submission status: Accepted

Solution code:
D, T, S = map(int,input().split())
if D/S > T:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
d, t, s = (int(i) for i in input().split())

if t*s-d >=0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
D, T, S = map(int, input().split())
#print(D, T, S)
t = D/S
if t <= T:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
D,T,S = map(int,input().split())

if T >= D/S:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
from sys import stdin
import math
inp = lambda : stdin.readline().strip()

d, t, s = [int(x) for x in inp().split()]
if s*t >= d:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
from sys import stdin
inp = lambda : stdin.readline().strip()

d, t, s = [int(x) for x in inp().split()]
if d / s <= t:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a <= b * c:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
data=list(map(int,input().split()))
if data[0]/data[1]<=data[2]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
d,t,s=map(int,input().split())
print("Yes" if t * s >= d else "No")

Submission status: Accepted

Solution code:
d, t, f = map(int, input().split())
if (d/t) <= f:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
D,T,S=map(int,input().split())
if D>T*S:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
a = input().split()

D = int(a[0])
T = int(a[1])
S = int(a[-1])


if D/S <= T:
    print('Yes')
else:
    print("No")

Submission status: Accepted

Solution code:
#import 
#=input()
#=int(input())
d,t,s=map(int,input().split())
#=list(map(int,input().split()))
#=[list(map(int,input().split())) for _ in range()]

if s * t >= d:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
d,t,s=input().split()

if int(d) <= int(t)*int(s):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
print('Yes' if a/c <= b else 'No')

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())

if s * t >= d:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
d,t,s = map(int, input().split())

if t >= d/s:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())

if d <= t * s:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
D, T, S = list(map(int, input().split(' ')))
if D <= S*T:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:list(map(int,stdin.readline().split()))

d,t,s=nii()
print('Yes' if d/s<=t else 'No')

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())
if D <= T * S:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:

d,t,s=[int(i) for i in input().split(" ")]

if((t*s)>=d):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
D,T,S = map(int,input().split())
if D/S > T:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
if s*t < d:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
import sys; input = sys.stdin.readline
from math import ceil
d, t, s = map(int, input().split())
u, l = ceil(d/t), d//t
if u == l:
    if u <= s: print("Yes")
    else: print("No")
else:
    if d/t <= s: print("Yes")
    else:print("No")

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split(" "))
ans = "Yes" if d <= t*s else "No"
print(ans)

Submission status: Accepted

Solution code:
def get_int_list():
  return list(map(int, input().split()))


d, t, s = get_int_list()
if t * s >= d:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub


import sys
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
buff_readline = sys.stdin.readline
readline = sys.stdin.readline

INF = 2**62-1


def read_int():
    return int(buff_readline())


def read_int_n():
    return list(map(int, buff_readline().split()))


def read_float():
    return float(buff_readline())


def read_float_n():
    return list(map(float, buff_readline().split()))


def read_str():
    return readline().strip()


def read_str_n():
    return readline().strip().split()

def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(D, T, S):
    return 'Yes' if D <= T*S else 'No'


def main():
    D, T, S = read_int_n()
    print(slv(D, T, S))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
if d <= t*s:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
d,t,s = map(int, input().split())
if(d-t*s>0):
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
input_list = [int(num) for num in input().split()]

D = input_list[0]
T = input_list[1]
S = input_list[2]

if D/S <= T:
    print("Yes")

else:
    print("No")

Submission status: Accepted

Solution code:
d,t,s = map(int, input().split())  
print('Yes' if d/s <= t else 'No')

Submission status: Accepted

Solution code:
d,t,s = map(int, input().split())  

# 整数で処理するため式を変形
# if d/s <= t
if d <= t*s:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

if D / T <= S:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
if a - b*  c <= 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
D,T,S = map(int,input().split())
if D/S>T:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
d, t, s = map(int,input().split())

if d <= t*s:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
d,t,s = map(int, input().split())  
time = d/s
if time <= t:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
d, t, s = list(map(int, input().split()))

if (s*t) >= d:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

if D > T*S:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
D,T,S = map(int,input().split())
time = D/S
if time<=T:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())

l = t * s

if l >= d:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
d,t,s = map(int, input().split())

if s*t >= d:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
d,t,s=map(int,input().split())
if t*s>=d:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
d,t,s = list(map(int,input().split()))
def p(val):
    print(val)


if d -s*t <= 0:
    p('Yes')
else:p('No')

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

print('Yes' if D / S <= T else 'No')

Submission status: Accepted

Solution code:
D,T,S = list(map(int, input().split()))

if D / S <= T:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

if T*S >= D:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())
print('Yes' if D <= T * S else 'No')

Submission status: Accepted

Solution code:
D, T, S = (int(a) for a in input().split())
if (D / S) <= T:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
#A - Dont be late
D,T,S = map(int,input().split())
Time =  float(D / S )
Tf = float(T)
# 出力
if Tf >= Time :
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
print('Yes') if d / s <= t else print('No')

Submission status: Accepted

Solution code:
D,T,S=map(int,input().split())

if T<D/S:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
if d / s <= t:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
D,T,S = map(int,input().split())

if D <= T*S:
    print("Yes")
else:print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

D, T, S = map(int, input().split())

time = D / S

if time <= T:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
d,s,t = map(int,input().split())

if t*s>=d:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
x, y,z = map(int, input().split()) 
test = x / z

if (test <= y):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
x = input().split()
T = int(x[0])/int(x[2])
if T <= int(x[1]):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
d,t,s=map(int,input().split())

if t*s>=d:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split(' '))
if d/s<=t:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
d, t, s = [int(x) for x in input().split()]

if(t*s>=d):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())
ans = "No"

if s * t >= d:
    ans = "Yes"
    
print(ans)

Submission status: Accepted

Solution code:
d,t,s=map(int,input().split())
if(d/s<=t):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())
if T * S >= D:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
#177 A
D,T,S = list(map(int, input().split()))
if D / S <= T:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
D,T,S=map(int,input().split())
if (D-1)//T<S:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
D, S, T= map(int, input().split())

time = D/S

if T >= time:
    print("Yes")

else :
    print("No")

Submission status: Accepted

Solution code:
D, S, T = map(int, input().split())
if D > S*T:
  print('No')
else:
  print('Yes')

Submission status: Accepted

Solution code:
d,t,s = map(int, input().split())
if d/s <= t:
  print ('Yes')
else:
  print ('No')

Submission status: Accepted

Solution code:
s = input().split()
d = int(s[0])
t = int(s[1])
s = int(s[2])
if d <= t * s:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())
if d/s <= t:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import math


def solve(D, T, S):
    minutes = math.ceil(D / S)
    ans = 'Yes' if T >= minutes else 'No'
    print(ans)


if __name__ == "__main__":
    D, T, S = map(int, input().split())
    solve(D, T, S)

Submission status: Accepted

Solution code:
D, T, S = list(map(int,input().split()))
 
if D <= T * S:
   print('Yes')
else:
   print('No')

Submission status: Accepted

Solution code:
d,t,s=map(int,input().split())
if d<=t*s:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
D,T,S = map(int,input().split())
if T*S >= D:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

time = D / S

if time > T:
  print("No")

else:
  print("Yes")

Submission status: Accepted

Solution code:
d,t,s=list(map(int,input().split()))
time=d/s
if(time<t or time==t):
    print("Yes")

else:
    print("No")

Submission status: Accepted

Solution code:
D,T,S = map(int, input().split())
if (D/T <= S):
  	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
D,T,S = map(int,input().split())
if D/S > T:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
x,y,z = input().split()
if ( int(x) / int(y) <= int(z)):
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
d,t,s=map(int,input().split())
if d<=t*s:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
print("Yes") if d / s <= t else print("No")

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
if d > t * s:
  print('No')
else:
  print('Yes')

Submission status: Accepted

Solution code:
d,t,s = map(int, input().split())
if s*t>=d:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())
if T*S >= D:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
ans = "No"
if d <= t*s: ans = "Yes"

print(ans)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
 
if a <= b * c:
  	print("Yes")
else:
  	print("No")

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
if d <= t * s:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a,t,s=map(int,input().split())
if a<=t*s:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
d, t, s = map(int,input().split())
if d <= t * s:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
d,t,s=map(int,input().split())
if d<=t*s:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
D,T,S = map(int,input().split())
a = D / S
if a > T:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
if d/s <= t:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
D, T, S = list(map(int, input().split()))
print("Yes" if T*S>=D else "No")

Submission status: Accepted

Solution code:
d,t,s = map(int, input().split())
if s*t < d:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())

if d <= t*s:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
length, time, speed = [int(x) for x in input().split(" ")]

if length / speed <= time:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    d,t,s = LI()
    if t*s < d:
        print("No")
    else:
        print("Yes")
    return

#Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
'''
    Auther: ghoshashis545 Ashis Ghosh
    College: jalpaiguri Govt Enggineerin College

'''
import sys
from collections import deque,defaultdict as dd 
from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
from itertools import permutations
from datetime import datetime
from math import ceil,sqrt,log,gcd
def ii():return int(input())
def si():return input()
def mi():return map(int,input().split())
def li():return list(mi())
abc='abcdefghijklmnopqrstuvwxyz'
abd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}
mod=1000000007
#mod=998244353
inf = float("inf")
vow=['a','e','i','o','u']
dx,dy=[-1,1,0,0],[0,0,1,-1]



def solve():
    
    
    
    # for _ in range(ii()):
    
    
  
    d,t,s=mi()
    if(t*s>=d):
        print('Yes')
    else:
        print('No')
    
    
    
    
    
    
        
    
    
if __name__ =="__main__":
    # read()
    solve()