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):
D, T, S = map(int, input().split())

if S >= (D/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())

print('Yes' if D <= T*S else '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 t * s >= 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())
print(['Yes','No'][D>T*S])

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())

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

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

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

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

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

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 = 0

time = d / t

if time <= s:
    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())
val = d/t
if val <= s:
	print("Yes")
else:
	print("No")

Solution (Python):
d,t,s = map(int,input().split())
val = d/t
if val <= 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())
print('Yes' if s*t>=d 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())

dis = S * T
if (dis >= D):
    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 T>=D/S:
  print('Yes')
else:
  print('No')

Solution (Python):
list_data = input().split(" ")

if int(list_data[0]) > int(list_data[1]) * int(list_data[2]):
  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 = list(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):
instr = input()
strx = instr.split()
D = int(strx[0])
T = int(strx[1])
S = int(strx[2])

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

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

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

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

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

Solution (Python):
dts = input().split()
D = int(dts[0])
T = int(dts[1])
S = int(dts[2])

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

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

t = T*S
if t>=D:
    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/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 = 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<=t*s else "No")

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

if(int(s) * int(t) >= int(d)):
  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())
print('Yes' if t*s >= d else 'No')

Solution (Python):
m, t, s = input().split()
if float(m) / float(s) <= float(t):
  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 s * t < d:
    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/s > t:
  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):
A = list(map(float, input().split()))

if(A[0]/A[2] <= A[1]):
  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(" "))
print("Yes" if t>=d*1.0/s else "No")

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

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

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())
move = T * S
if move >= D:
  print('Yes')
else:
  print('No')

Solution (Python):
requestMap = list(map(float, input().split()))

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

dist = S * T

if dist >= D:
  print("Yes")
else:
  print("No")

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

tmp = d/s

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

Solution (Python):
import sys

num_list = [int(i) for i in input().split()]

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

Solution (Python):
D,T,S=map(int, input().split())
if T-D/S>=0 :
  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())
ans = 'Yes' if D / S <= T else '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=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 <= 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 = (int(x) for x in 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):
dts_s = input().split()
dts_i = [int(n) for n in dts_s]
if dts_i[0]/dts_i[1] > dts_i[2]:
  print("No")
else:
  print("Yes")

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):
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 s*t<d:
  print('No')
else:
  print('Yes')

Solution (Python):
a = input().split()
D = int(a[0])
T = int(a[1])
S = int(a[2])

jikan = D / S

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

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

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

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

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

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

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

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()]
if S*T >= D:
  print("Yes")
else:
  print("No")

Solution (Python):
d, t, s = map(int, input().split())
if t*s >= d:
    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 = 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):
D, T, S = list(map(int, input().split()))

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

Solution (Python):





import math
import fractions
import sys
import bisect
import heapq  
import collections
from collections import Counter
from collections import deque
import pprint
import itertools

"""nを素因数分解"""
"""2以上の整数n => [[素因数, 指数], ...]の2次元リスト"""

def factorization(n):
    arr = []
    temp = n
    if n == 1:
        return arr

    for i in range(2, int(-(-n ** 0.5 // 1)) + 1):
        if temp % i == 0:
            cnt = 0
            while temp % i == 0:
                cnt += 1
                temp //= i
            arr.append([i, cnt])

    if temp != 1:
        arr.append([temp, 1])

    if arr == []:
        arr.append([n, 1])

    return arr



def power(a, n, mod):
    x = 1
    while n:
        if n & 1:
            x *= a % mod
        n >>= 1
        a *= a % mod
    return x % mod



def kaijo(n, l, mod):
    if n == 0:
        return 1
    a = n
    tmp = n - 1
    while (tmp >= l):
        a = a * tmp % mod
        tmp -= 1
    return a


class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())


def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    divisors.sort()
    return divisors

inf = 10 ** 18
mod = 10 ** 9 + 7

_INPUT = """\
1000 15 80
"""

def main(*, input=input):
    sr = lambda: input()
    ir = lambda: int(sr())
    lr = lambda: list(map(int, sr().split()))

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


if __name__ == "__main__":
    import io, sys

    

    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())
ans = "Yes" if d / s <= t else "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 D <= T*S:
  print("Yes")
else:
  print("No")

Solution (Python):
nums=input().split()
t=int(nums[0])/int(nums[2])
if t<=int(nums[1]):
  print("Yes")
else:
  print("No")

Solution (Python):
D, T, S=map(int, input().split())
if S*T-D>=0: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())
print("Yes" if D <= T*S 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/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 S * T < D:
  print('No')
else:
  print('Yes')

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

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

Solution (Python):

from sys import stdin

input = stdin.readline().rstrip







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())
print(
  'Yes' if d / s <= t else 'No'
)

Solution (Python):

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



if S*T < D:
	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 / 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('No')
else:
    print('Yes')

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 (D + S - 1) // S <= T:
    print('Yes')
else:
    print('No')

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

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

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

Solution (Python):
input_data = list(map(int, input().strip().split()))
if (input_data[0] / input_data[2] <= input_data[1]):
    print("Yes")
else:
    print("No")

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

Solution (Python):
INPUT = input().split()
D = int(INPUT[0])
T = int(INPUT[1])
S = int(INPUT[2])

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

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

if d - t * s > 0:
    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):
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    D, T, S = LI()

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

if __name__ == '__main__':
    resolve()

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())
    speed = D / T
    if speed <= S:
        print("Yes")
    else:
        print("No")
if __name__ == '__main__':
    main()

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

print('Yes'if NNN[1]*NNN[2]>=NNN[0] else 'No')

Solution (Python):
D, T, S = map(int, input().split())
B = D/S
if B > 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 (t * s >= d):
    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):
s = input().split()
t = int(s[1])*int(s[2])
if (int(s[0]) <= t):
    print("Yes")
else:
    print("No")

Solution (Python):
D,T,S = input().split()
if int(D)/int(S) > int(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())

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

Solution (Python):
data=str(input("")).split(" ")
D=int(data[0])
T=int(data[1])
S=int(data[2])

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

Solution (Python):
"""A."""

import sys

input = sys.stdin.readline  

D, T, S = map(int, input()[:-1].split(' '))

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

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

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

Solution (Python):
x, y, z = map(int, input().split())
if x <= y*z:
  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','No')[d/s>t])

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

Solution (Python):
import base64
import subprocess


exe_bin = "e??420s

open("./kyomu", 'wb').write(base64.b85decode(exe_bin))
subprocess.run(["chmod +x ./kyomu"], shell=True)
subprocess.run(["./kyomu"], shell=True)

Solution (Python):


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

Solution (Python):
x, y, z = [int(a) for a in input().split()]
if y*z>=x:
  print("Yes")
else:
  print("No")

Solution (Python):
m, s, mps = [int(x) for x in input().split()]
time = m / mps

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

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

Solution (Python):

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

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

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):
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 T >= D/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):

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

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())
print("Yes" if D/T <= S else "No")

Solution (Python):
d,t,s=map(int,input().split())
if(s>=(d/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())
print('YNeos'[D/S>T::2])

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):
list =input().split()

list = [int(i) for i in list]

D=list[0]

S=list[1]

T=list[2]


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

Solution (Python):
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy
 
def main():
    d,t,s = map(int, input().split())
    if d <= t*s:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    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())
 
if D > T*S :
 print("No")
else:
  print("Yes")

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("No")
else:
  print("Yes")

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 <= T * S:
    print("Yes")
else:
    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 = [int(x) for x in input().split()]
if d/s <= t:
  print("Yes")
else:
  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):
def main():
    d, t, s = map(int, input().split())
    print("Yes" if d / s <= t else "No") 


if __name__ == "__main__":
    main()

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

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

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

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

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

print('Yes' if T * S >= D 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 S*T >= D:
    print("Yes")
else:
    print("No")

Solution (Python):
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')

Solution (Python):

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


if __name__ == '__main__':
	main()

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

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

Solution (Python):
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)

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()

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 > 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())
print('Yes') if S*T >= D else print('No')

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

Solution (Python):
import sys

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

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

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

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])

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())

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

Solution (Python):
D, T, S = input().split()
sum_price = int(T) * int(S)
if int(D) <= sum_price:
  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,V,T = map(int,input().split())
time = D / V
if time <= T:
  print("Yes")
else:
  print("No")

Solution (Python):
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')

Solution (Python):



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


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

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

if (n/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):
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")

Solution (Python):
D,T,S = map(int,input().split())
if S*T < D :
  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 t*s >=d:
    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/c<=b:
  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):

Information_Lists = input().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")

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

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


if __name__ == '__main__':
    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())

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

Solution (Python):
D, T, S = tuple(int(x) for x in 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):
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()

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

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

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