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 (Python):
import collections

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

q, mod = divmod(D, S)

if mod == 0:
  if q <= T:
    print("Yes")
  else:
    print("No")
else:
  if q <= T-1:
    print("Yes")
  else:
    print("No")

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

Solution (Python):
[d,t,s]=list(map(int,input().split()))
time=d/s
ans="No"
if time<=t:
    ans="Yes"

print(ans)

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

Solution (Python):
def solution(D,T,S):
    return 'Yes' if T >= (D/S) else 'No'

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

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

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

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

Solution (Python):
D,T,S=map(float,input().split())

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

Solution (Python):

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

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

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

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

Solution (Python):
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext



def i_input(): return int(input())


def i_map(): return map(int, input().split())


def i_list(): return list(i_map())


def i_row(N): return [i_input() for _ in range(N)]


def i_row_list(N): return [i_list() for _ in range(N)]


def s_input(): return input()


def s_map(): return input().split()


def s_list(): return list(s_map())


def s_row(N): return [s_input for _ in range(N)]


def s_row_str(N): return [s_list() for _ in range(N)]


def s_row_list(N): return [list(s_input()) for _ in range(N)]


def lcm(a, b): return a * b // gcd(a, b)


sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []


def main():
    d, t, s = i_list()

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


if __name__ == '__main__':
    main()

Solution (Python):
import math
d,t,s = map(int, input().split())
time = math.ceil(d/s)
if time <= t:
    print('Yes')
else:print('No')

Solution (Python):
def walk(d, t, s)-> int :
  minutes = d / s
  if minutes <= t:
    return 'Yes'
  return 'No'

if __name__ == "__main__":
  input = list(map(int, input().split()))
  print(walk(input[0], input[1], input[2]))

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

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

Solution (Python):
D, T, S = input().split(' ')

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

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

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

Solution (Python):
D, T, S  = [int(i) for i in input().split()]

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

Solution (Python):
D, T, S = [ int(v) for v in input().split(" ") ]

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

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

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

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

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

Solution (Python):
d, t, s = map(int, input().split())
ans = d/float(s)
if (t >= ans):
    print('Yes')
else:
    print('No')

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

Solution (Python):









def main():
    args = input().split()
    D = int(args[0])
    T = int(args[1])
    S = int(args[2])

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


if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
def Takoyaki():
    
    data = list(map(int,input().split()))

    num = data[0] / data[2]

    if num <= data[1]:
                
        print('Yes')

    else:
        print('No')

if __name__ == '__main__':
    Takoyaki()

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

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

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

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

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

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

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

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

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

Solution (Python):
D, T, S = [int(_) for _ in input().split()]

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

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

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

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

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

move = t*s
if d <= move:
    ans = 'Yes'
else:
    ans = 'No'

print(ans)

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

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

Solution (Python):
nums = [int(e) for e in input().split()]

d = nums[0]
t = nums[1]
s = nums[2]

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

Solution (Python):

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

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

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

Solution (Python):
d,t,s = map(int,input().split())
if d / s > float(t):
  ret = 'No'
else:
  ret = 'Yes'
  
print(ret)

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

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

Solution (Python):


import math
import re
import numpy as np
import copy


S = input().split(' ')
D = int(S[0])
T = int(S[1])
S = int(S[2])

time = D / S

ans = "No"

if time <= T:
    ans = "Yes"

print(ans)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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


m = d/s

if m <=t:
    print("Yes")
else:
    print("No")

Solution (Python):
num = list(map(lambda x: int(x), input().split()))

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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 9)

def int1(x): return int(x) - 1
def II(): return int(input())
def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def MS(): return input().split()
def LS(): return list(input())
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def printlist(lst, k=' '): print(k.join(list(map(str, lst))))
INF = float('inf')







def solve():
    d, t, s = MI()
    if s * t >= d:
        print('Yes')
    else:
        print('No')
if __name__ == '__main__':
    solve()

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

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

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

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

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

else:
    print("No")

Solution (Python):
a, b, c= map(int,input().split())

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

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

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

distance = T * S

if D > distance:
  print('No')
else:
  print('Yes')

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

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

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

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


if __name__ == "__main__":
    print(main())

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

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

m = d//s
if d%s != 0:
  m += 1

if m <= t :
  print("Yes")
else :
  print("No")

Solution (Python):


import sys
import math


debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        for line in sys.stdin:
            lines.append(line.strip())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    (d, t, s) = [int(e) for e in lines[0].split(" ")]
    

    return (d, t, s)


def solve(d, t, s):

    tmp = d / s 
    result = 'No'
    if tmp <= t:
        result = 'Yes'


    return result
    


def main():
    
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()

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

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

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

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

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

Solution (Python):
def main():
    D, T, S = map(int, input().split())


    return "Yes" if D/S <= T else "No"

if __name__ == '__main__':
    print(main())

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

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

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

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

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

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

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

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


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

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

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

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

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

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

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

Solution (Python):
import math
D,T,S = map(int,input().split())

calc = math.ceil(D/S)

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

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

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

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

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

Solution (Python):
a,b,c = list(map(int,input().split()))

if a/c <= b:
  print('Yes')
else:
  print('No')

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

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

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

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

m = D / S

if T >= m:
  print('Yes')
else:
  print('No')

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

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

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

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

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

time = D/S

if T >= time:
    print('Yes')
else:
    print('No')

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

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

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

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

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

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

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

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

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

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

div = d//s
md = d%s

if md == 0:
  if div <= t:
    print("Yes")
    exit()
else:
  if div+1 <= t:
    print("Yes")
    exit()

print("No")

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

a=d/s

if a<=t:
  print("Yes")
else:
  print("No")

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

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

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

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

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

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

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

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

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

f=d/s

if f<=t:
    print('Yes')
else:
    print('No')

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

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

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

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

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

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

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

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

Solution (Python):
line = input().split()
line = list(map(int, line))

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

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

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

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

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

t = D / S

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

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

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

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

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

Solution (Python):


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


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


print(ans)

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

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

Solution (Python):


import os
import sys
from io import BytesIO, IOBase

"""
    for _ in range(int(input())):
    n,m=map(int,input().split())
    n=int(input())
    a = [int(x) for x in input().split()]
"""

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




BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")



if __name__ == "__main__":
    main()

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


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

Solution (Python):
def main():
    d, t, s = [int(e) for e in input().split()]

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

    print('No')


if __name__ == '__main__':
    main()

Solution (Python):
import sys
from io import StringIO
import unittest
import os


sys.setrecursionlimit(999999999)



def resolve(test_def_name=""):
    d, t, s = map(int, input().split())

    aa = t * s

    if aa >= d:
        print("Yes")
    else:
        print("No")



class TestClass(unittest.TestCase):
    def assertIO(self, assert_input, output):
        stdout, sat_in = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(assert_input)
        resolve(sys._getframe().f_back.f_code.co_name)
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, sat_in
        self.assertEqual(out, output)

    def test_input_1(self):
        test_input = """1000 15 80"""
        output = """Yes"""
        self.assertIO(test_input, output)

    def test_input_2(self):
        test_input = """2000 20 100"""
        output = """Yes"""
        self.assertIO(test_input, output)

    def test_input_3(self):
        test_input = """10000 1 1"""
        output = """No"""
        self.assertIO(test_input, output)

    
    def test_original(self):
        pass



if __name__ == "__main__":
    if os.environ.get("USERNAME") is None:
        
        resolve()

    else:
        
        unittest.main()

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

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

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

Solution (Python):
def Qa():
    d, t, s = map(int, input().split())
    a = d / s
    ans = 'No'
    if a <= t:
        ans = 'Yes'
    print(ans)


if __name__ == '__main__':
    Qa()

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

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

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

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

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

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

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

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

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

Solution (Python):
dts = input().split()

d = int(dts[0])
t = int(dts[1])
s = int(dts[2])

time = d / s

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

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

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

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

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

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

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

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

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

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

if D%S==0:
    if int(D/S)<=T:
        print("Yes")
    else:
        print("No")
        
else:
    if int(D/S)+1<=T:
        print("Yes")
    else:
        print("No")

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

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

Solution (Python):


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

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

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

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

Solution (Python):
A,B,C=map(int,input().split())
if B>=(A/C):
    print('Yes')
else:
    print('No')

Solution (Python):
D,T,S=[int(s) for s in input().split()]
if D>T*S:
  print('No')
else:
  print('Yes')

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

Solution (Python):
num_line = input().split(" ")
kyori = int(num_line[0])
funsoku = int(num_line[1])
time = int(num_line[2])

result = 0
if funsoku*time >= kyori:
    result = 1

if result==0:
    print("No")
else:
    print("Yes")

Solution (Python):
[D, T, S] = list(map(int,input().split()))

if D/S <= T :
    ans = 'Yes'
else :
    ans = 'No'

print(ans)

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

main()

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


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

Solution (Python):
int_a, int_b, int_c= map(int, input().split())


if int_a/int_c <= int_b:
  print('Yes')
else:
  print('No')

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

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

print(ans)

Solution (Python):
import numpy as np

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

time = D/S

if time > T:
    print("No")
else:
    print("Yes")

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

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

else:
    print("No")

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

a = T*S

if a >= D:
    print('Yes')
else:
    print('No')

Solution (Python):
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")
al = "abcdefghijklmnopqrstuvwxyz"

d,t,s = I()

a = d/s

if a <= t:
    print("Yes")
else:
    print("No")

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

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


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

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

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


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

Solution (Python):
import numpy as np

DTS=np.array(input().split(" "),dtype=np.int64)
D=DTS[0]
T=DTS[1]
S=DTS[2]

time=float(D/S)

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

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

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

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

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

Solution (Python):

import sys
sys.setrecursionlimit(1000000)
from collections import deque


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

tmp = D / S

if tmp >  T:
    print('No')
else:
    print('Yes')

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

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

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

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

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

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

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

Solution (Python):
firstLine = input()
distance, time, speed = list(map(int,firstLine.split(' ')))[0], list(map(int,firstLine.split(' ')))[1], list(map(int,firstLine.split(' ')))[2]

if distance / speed <= time:
  print('Yes')
else:
  print('No')

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

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

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

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

Solution (Python):
from sys import stdin

d,t,s = [int(x) for x in stdin.readline().split()]

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
x, y, z = list(map(int, input().split()))
if(x<=y*z):
    print("Yes")
else:
    print("No")

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

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

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

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

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