peterverebics/CodeNet_Python_118 huggingface dataset:
d, t, s = map(int, input().split())
if d/s <= t: print("Yes")
else: print("No")
d, t, s = map(int, input().split())

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

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

if t*s >= d:
    print('Yes')
else:
    print('No')
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

d,t,s=map(int,input().split())
YesNo(-(-d//s)<=t)
def main():
    D, T, S = map(int, input().split())

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

input_ = sys.stdin.readline

D, T, S = [int(x) for x in input_().strip().split(" ")]

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

input = sys.stdin.readline



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

time = d / s

if time <= t:
    print("Yes")
else:
    print("No")
a,b,c=map(int,input().split())
if (b*c >= a):
	print('Yes')
else:
	print('No')
A,B,C = map(int,input().split())
X = A // C
Y = A % C
if Y != 0:
  X += 1
print("Yes" if X <= B else "No")
def solve():
    d, t, s = map(int, input().split())
    f = d/s
    print("Yes" if f <= t else "No")


def main():
    t = 1
    while t > 0:
        solve()
        t -= 1


main()
D,T,S = map(int,input().split())
if T >= D/S:
    print("Yes")
else:
    print("No")
d,t,s = map(int, input().split())

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

if T*S >= D:
    print('Yes')
else:
    print('No')
A = list(map(int, input().split()))
if A[0] <= A[1] * A[2]:
    print("Yes")
else:
    print("No")
D, T, S = map(int, input().split())

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

a = T*S

if a >= D:
    print('Yes')
else:
    print('No')
def l_in(type_): return list(map(type_, input().split()))
def i_in(): return int(input())
def m_in(type_): return map(type_, input().split())
def r_in(n, type_): return [type_(input()) for _ in range(n)]
ans = None

d, t, s = m_in(int)
ans = 'Yes' if d <= t*s else 'No'

print(ans)
import sys
input = sys.stdin.buffer.readline

#sys.setrecursionlimit(10**9)
#from functools import lru_cache

def RD(): return input().rstrip().decode()
def II(): return int(input())
def FI(): return float(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode()


def main():
	d,t,s=MI()
	ans="No"

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














if __name__ == "__main__":
	main()
d,t,s = input().split()

gool = int(d) / int(s)
if gool <= int(t):
    print('Yes')
else:
    print('No')
d, t, s = map(int, input().split())
if d / s <= t:
    print("Yes")
else:
    print("No")
import sys,os
import math
from fractions import Fraction 
from collections import defaultdict
from random import randint

# sys.stderr=open('err.txt','w')
# sys.stdout=open('output.txt','w')
# sys.stdin=open('input.txt','r')

def linput():
    return list(minput())

def minput():
    return map(int, sys.stdin.readline().strip().split())

###############################################################

d,t,s=minput()
if d/s>t:
    print("No")
else:
    print("Yes")
d,t,s = map(int,input().split())
if d > t * s:
  print("No")
else:
  print("Yes")
d, t, s = map(int, input().split())
taken = d / s
if taken > t:
    print('No')
else:
    print('Yes')
class Solution:
    def solve(self, D, T, S):
        time = D/S
        if time <= T:
            return 'Yes'
        else:
            return 'No'

if __name__ == '__main__':
    D, T, S = map(int, input().split())
    A = Solution()
    print(A.solve(D, T, S))
d, t, s = map(int, input().split())

if d <= t * s:
    print("Yes")
else:
    print("No")
D,T,S=map(int,input().split())
if S*T>=D:
    print("Yes")
else:
    print("No")
d, t, s = map(int, input().split())
if s*t >= d:
  print("Yes")
else:
  print("No")
d,t,s = list(map(int,input().split()))

x=d/s

if t>=x:
    print("Yes")

else:
    print("No")
d, t, s= map(int, input().split())
ttt=d-t*s
if (ttt <= 0):
  print('Yes')
else:
  print('No')
D, T, S = map(int,input().split())

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

if t*s >= d:
    print('Yes')
else:
    print('No')
d,t,s=map(int,input().split())
if(d/s<=t):
  print("Yes")
else:
  print("No")
d, t, s = map(int, input().split())
print("Yes") if d <= t*s else print("No")
# -*- coding: utf-8 -*-
"""
Created on Sat Aug 29 21:05:56 2020

@author: naoki
"""

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

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

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

if d / s > t:
    print('No')
else:
    print('Yes')
d,t,s=map(int, input().split())
if d/t <= s:
  print("Yes")
else:
  print("No")
# Press the green button in the gutter to run the script.
if __name__ == '__main__':
    d, t, s = map(int, input().split())

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

if(b>=(a/c)):
    print("Yes")
else:
    print("No")
D, T, S = map(int, input().split())
NT = D/S
if NT > T:
    print("No")
else:
    print("Yes")
d,t,s=map(int,input().split())
if t>=d/s:
  print("Yes")
else:
  print("No")
d, t, s = list(map(int, input().split()))

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

if d <= t*s:
  print("Yes")
else:
  print("No")
D, T, S = input().split()

m = float(D) / float(S)

if int(T) >= m:
  print('Yes')
else:
  print('No')
D, T, S = map(int,input().split())
if D/S <= T:
  print("Yes")
else:
  print("No")
d,t,s = map(int,input().split())

if d <= s*t:
    print('Yes')
else:
    print('No')
input_data = list(map(int, input().strip().split()))
if (input_data[0] / input_data[2] <= input_data[1]):
    print("Yes")
else:
    print("No")
d, t, s = map(int, input().split())
print('Yes' if s * t >= d else 'No')
D, T, S = map(int, input().split())
a = D / S
if a <= T:
    print('Yes')
else:
    print('No')
d, t, s = map(int, input().split())
time = d / s
if time <= t:
    print("Yes")
else:
    print("No")
import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))  #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())  #空白あり
def LS2(): return list(sys.stdin.readline().rstrip())  #空白なし


D,T,S = MI()
print('Yes' if S*T >= D else 'No')
d, t, s= map(int,input().split())
if d/s <= t:
    print('Yes')
else:
    print("No")
d, t, s = map(int, input().split())
ans = "No"
if d / s <= t:
    ans = "Yes"

print(ans)
D, T, S = map(int, input().split())
print("Yes" if D - T*S <= 0 else "No")
d,t,s=map(int,input().split())
p=d/s
if t>=p:
  print('Yes')
else:
  print('No')
a,b,c=map(int, input().split())
if b*c>=a:
    print("Yes")
else:
    print("No")
d, t, s = map(int, input().split())

if d <= s * t:
    print('Yes')
else:
    print('No')
d,t,s = map(int,input().split())
if d <= s * t:
    print("Yes")
else:
    print("No")
d, t, s = map(int, input().split())
time = d/s
if t < time:
  print("No")
else:
  print("Yes")
D, T, S = map(int, input().split())
if D/S <= T:
    print('Yes')
else:
    print('No')
from sys import stdin

def main():

    input = stdin.readline

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

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


if __name__ == "__main__":
    main()
in1 = list(map(int,input().split()))
D = in1[0]
T = in1[1]
S = in1[2]

if D <= T * S:
    print('Yes')
else:
    print('No')
d,t,s = map(int,input().split())
if  t*s >= d:
    print("Yes")
else:
    print("No")
d,t,s=map(int,input().split())
if(s>=(d/t)):
    print("Yes")
else:
    print("No")
d,s,t = map(int,input().split())

t_2 = d/s

if(t >= t_2):
    print('Yes')
else:
    print('No')
D, T, S = map(int, input().split())
if D / S <= T:
    print("Yes")
else:
    print("No")
D,T,S=map(int,input().split())
if T*S>=D:
    print('Yes')
else:
    print('No')
string_list = input().split(' ')
D = int(string_list[0])
T = int(string_list[1])
S = int(string_list[2])
kyori = T * S
if D<=kyori:
  print('Yes')
else:
  print('No')
D, T, S = map(int, input().split())

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

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

if D <= T * S:
    print("Yes")
else:
    print("No")
i = input().split(" ")
i1 = int(i[0])
i2 = int(i[1])
i3 = int(i[2])

arrive = (i1 / i3) <= i2
if arrive:
  print("Yes")
else:
  print("No")
D,T,S = map(int,input().split())
if S*T < D:
    print('No')
else:
    print('Yes')
D, T, S = map(int, input().split())

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

if d/s<=t:
  print("Yes")
else:
  print("No")
d, t, s = list(map(int, input().split()))
if d <= t*s:
    print('Yes')
else:
    print('No')
D,T,S = list(map(int,input().split()))
if T*S>=D:
    print("Yes")
else:
    print("No")
d,t,s=[int(x) for x in input().split(' ')]
if s*t>=d:
    print("Yes")
else:
    print("No")
A,B,C=map(int,input().split())
if B*C>=A:
    print("Yes")
else:
    print("No")
d,t,s=map(int,input().split())
if d/t<=s:
  print("Yes")
else:
  print("No")
#!/usr/bin/env python3
import sys

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


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

if s * t >= d:
    print('Yes')
else:
    print('No')
from sys import stdin

input = stdin.readline

D, T, S = map(int, input().split())
print('Yes' if S*T >= D else 'No')
d,t,s=map(int,input().split())
print('YNeos'[d>t*s::2])
dist, t_fun, s_hayasa = map(int, input().split())

kyori = t_fun * s_hayasa

if (kyori >= dist):
    print('Yes')
else:
    print('No')
def main():
    D, T, S = map(int, input().split())

    if D/S <= T:
        print("Yes")
    else:
        print("No")
    
if __name__ == "__main__":
    main()
d,t,s=map(int,input().split())

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

if(s*t >= d):
    print("Yes")
else:
    print("No")
d, t, s = map(int, input().split())
print('Yes' if d <= t*s else 'No')
#!/usr/bin/env python3
import sys
from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right
from itertools import accumulate

sys.setrecursionlimit(10**6)
INF = 10**12
m = 10**9 + 7

def main():
    D, T, S = map(int, input().split())
    print('Yes') if D -T*S <= 0 else print('No')

if __name__ == "__main__":
    main()
D,T,S = [int(x) for x in input().split()]
time = D/S


if T>=time:
    print("Yes")
else:
    print("No")
D,T,S = map(int,input().split())
if D/S > T:
    print("No")
else:
    print("Yes")
def main():
    import math
    d, t, s = map(int, input().split())
    m = math.ceil(d/s)
    print("Yes" if m <= t else "No")

if __name__ == '__main__':
    main()
d,t,s=map(int,input().split())
print("Yes" if t*s>=d else "No")
d,t,s = map(int,input().split())
time = d/t
if time <= s:
    print('Yes')
else:
    print('No')
D,T,S = map(int, input().split())

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

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

m=d/s

if m<=t:
    print('Yes')
else:
    print('No')
n = list(map(int,input().split()))
t = n[0] / n[2]
if t <= n[1]:
    print('Yes')
else:
    print('No')
d, t, s = map(int, input().split())
if s*t >= d:
    print("Yes")
else:
    print("No")
D,T,S = map(int, input().split())

print('No' if S*T < D else 'Yes')
d,t,s = map(int, input().split())


if d / s <= t:
  print("Yes")
else:
  print("No")
#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')
#!/usr/bin/env python3

d,t,s=map(int,input().split())    #->x=1,y=2

if (d-(t*s)) <= 0:
    print('Yes')
else:
    print('No')
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")
d,t,s=map(int,input().split())
if d/s<=t:
    print('Yes')
else:
    print('No')
line = input(' ').split()
minu = int(line[0]) / int(line[2])
time = int(line[1])
if minu > time:
    print('No')
else:
    print('Yes')
#!/usr/bin/env python3
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')
D,T,S = map(int,input().split())
print('Yes' if T*S >= D else 'No')
D,T,S=map(int,input().split())

M=D/S
if M <= T :
    print("Yes")
else:
    print("No")
d, t, s = map(int, input().split())
if d > t * s:
    print("No")
else:
    print("Yes")
d,t,s = list(map(int, input().split()))
if d / s <= t:
  print('Yes')
else:
  print('No')
D, T, S = list(map(int, input().split()))
if D/S<=T:
    print('Yes')
else:
    print('No')
D, T, S, = map(int, input().split())
result = T * S
if result >= D:
    print("Yes")
else:
    print("No")
d, t, s = list(map(int, input().split()))
if d/s <= t:
  print("Yes")
else:
  print("No")
d,t,s=map(int,input().split())
print("Yes")if d/s<=t else print("No")
D,T,S=map(float,input().split())

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

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

dif = d / s

if dif <= t:
    print("Yes")

else:
    print("No")
D, T, S = map(int, input().split())

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

print(['No','Yes'][(D/T)<=S])
D, T, S = map(int, input().split())
print("Yes" if D <= S*T else "No")
D, T, S = [int(x) for x in input().split()]
if S * T >= D:
    print('Yes')
else:
    print('No')
d, t, s = map(int,input().split())
r = d % s
l = d / s
if l <= t:
	print("Yes")
else:
	print("No")
d,t,s = map(int,input().split())
if d / s <= t:
    print("Yes")
else:
    print("No")
D,T,S = map(int,input().split( ))

if T >= D/S:
    print('Yes')
else:
    print('No')
def resolve():
    d, t, s = list(map(int, input().split()))
    if s * t >= d:
        print('Yes')
        return

    print('No')
resolve()
a,b,c = map(int, input().split())
if b*c >=a:
    print('Yes')
else:
    print('No')
d,t,s=map(int,input().split())
if d>t*s:
    print('No')
else:
    print('Yes')
d,t,s=list(map(int,input().split()))
time=d/s
if(time<t or time==t):
    print("Yes")

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

if (d/s)<=t:
    print("Yes")
else:
    print("No")
a,b,c = map(int,input().split())
if a <= b*c:
    print("Yes")
else:
    print("No")
d,t,s=map(int,input().split())
print('Yes' if s*t>=d else 'No')
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
 
def main():
    D, T, S = map(int, readline().split())
    if T*S >= D:
        print('Yes')
    else:
        print('No')
if __name__ == '__main__':
    main()
# -*- coding: utf-8 -*-
D,T,S = [int(i) for i in input().split()]
if T*S < D:
    print("No")
else:
    print("Yes")
import sys

try:
    #d = int(input('D: '))
    #t = int(input('T: '))
    #s = int(input('S: '))
    nums = [int(e) for e in input().split()]
except ValueError:
    print('エラー：整数以外を入力しないでください')
    sys.exit(1)

if 1 <= nums[0] <= 10000 and 1 <= nums[1] <= 10000 and 1 <= nums[2] <= 10000:
    take_time = nums[0] / nums[2]
    if take_time <= nums[1]:
        print("Yes")
    else:
        print("No")
else:
    print('エラー：各入力は1～10000までの整数です')
d,t,s=map(int,input().split())
print("Yes" if d<=t*s else "No")
def main():
	d, t, s = map(int, input().split())
	print("Yes") if d/s<=t else\
		     print("No")
main()
d,t,s=map(int,input().split())
if d<=t*s:
  print('Yes')
else:
  print('No')
d, t, s = list(map(int, input().split()))
if d <= t*s:
  print("Yes")
else:
  print("No")
d, t, s = map(int, input().split())
take_time = d / s
print('Yes' if t >= take_time else 'No')
D, T, S = map(int, input().split())
if T * S >= D:
    print("Yes")
else:
    print("No")
d,t,s=map(int,input().split())
time=d/s
if(t<time):
  print('No')
else:
  print('Yes')
# = int(input())
# = str(input())
D, T, S = map(int, input().split())
# = list(map(int, input().split()))
# = [int(input()) for i in range(N)]
# = [list(map(int, input().split())) for i in range(N)]

if S*T - D >= 0:
    print("Yes")
else:
    print("No")
import sys
sys.setrecursionlimit(10**6)


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


if __name__ == '__main__':
    main(sys.stdin.readline, print)
print('Yes' if eval(input().replace(' ','<=',1).replace(' ','*',1)) else 'No')
D, T, S = map(int, input().split())

ans = 'No'
if D / S <= T:
    ans = 'Yes'
print(ans)
d,t,s =[int(c) for c in input().split()]
tt = d /s 
if tt <= t:
    print("Yes")
else:
    print("No")
#: Author - Soumya Saurav
import sys,io,os,time
from collections import defaultdict
from collections import OrderedDict
from collections import deque
from itertools import combinations
from itertools import permutations
import bisect,math,heapq
alphabet = "abcdefghijklmnopqrstuvwxyz"

input = sys.stdin.readline

########################################
d ,t , s = map(int , input().split())
if d/t <= s:
	print("Yes")
else:
	print("No")
def main():
    D, T, S = map( int, input().split())
    if S*T >= D:
        print("Yes")
    else:
        print("No")
if __name__ == '__main__':
    main()
D, T, S = map(int, input().split())

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

# 割り算（＝少数が出る）は使わずに、整数演算のみで解く
if D <= S*T: print('Yes')
else: print('No')
a = input().split()

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

if D/S > T:
  print('No')
else:
  print('Yes')
d,s,t = map(float, input().split())

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

sys.setrecursionlimit(500005)
stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().strip()

d, t, s = na()
print("Yes" if s * t >= d else "No")
d, t, s = map(int, input().split())
print("Yes" if d <= t * s else "No")
#A
D,T,S= map(int,input().split())
if D/S<=T:
    print("Yes")
else:
    print("No")
d, t, s = map(int, input().split())
if(d/s <= t):print("Yes")
else:print("No")
# import sys; input = sys.stdin.buffer.readline
# sys.setrecursionlimit(10**7)
from collections import defaultdict
con = 10 ** 9 + 7; INF = float("inf")

def getlist():
	return list(map(int, input().split()))

#処理内容
def main():
	D, T, S = getlist()
	if S * T >= D:
		print("Yes")
	else:
		print("No")


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

if d/s <= t:
  print("Yes")
else:
  print("No")
def main():
    D, T, S = map(int, input().split())
    answer = solve(D, T, S)
    print(answer)


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


if __name__ == "__main__":
    main()
d, t, s = map(int, input().split())
if d / s <= t:
    print('Yes')
else:
    print('No')
d,t,s=map(int,input().split())
if d/s<=t:
    print("Yes")
else:
    print("No")
td,tm,dpm =tuple(map(int,input().split(" ")))
if td/dpm <= tm:
    print("Yes")
else:
    print("No")
d, t, s = map(int, input().split())

if d / s <= t:
  print("Yes")
else:
  print("No")
D, S, T = map(int, input().split())
print('Yes' if S * T >= D else 'No')
def on_time(D, T, S):
    if T >= (D / S):
        return True
    return False
def start():
    d,t,s = [int(x) for x in input().split(" ")]
    if on_time(d,t,s):
        print("Yes")
    else:
        print("No")
start()
d,t,s = map(int,input().split())

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

else:
    print('No')
#!/usr/bin/env python3

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

d, t, s = LI()
if s*t < d:
    print('No')
else:
    print('Yes')
D, T, S = map(int, input().split())

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

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

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

if D <= N * S:
    print('Yes')
else:
    print('No')
d, t, s = map(int, input().split())
a = (d + s - 1) // s
if a > t:
    print('No')
else:
    print('Yes')
d,t,s = list(map(int,input().split()))

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

if D / S <= T :
  print('Yes')
else:
  print('No')
x, y, z = input().split()
x = int(x)
y = int(y)
z = int(z)
if x / z <= y:
    print("Yes")
else:
    print("No")
d,t,s = map(int,input().split())
if d/s <=t:
  print("Yes")
else:
  print("No")
st = str(input())
dum = st.split()
d = int(dum[0])
t = int(dum[1])
s = int(dum[2])

tv = float(d / t)
if tv <= s:
    print('Yes')
else:
    print('No')
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")
D ,T, S   = map(int,input().split()) 
if (D )/ S <= T :
    print('Yes')
else:
    print('No')
D, T, S = list(map(int, input().split()))

if (D <= T * S):
    print("Yes")
else:
    print("No")
D, T, S = map(int, input().split(' '))
 
if S*T >= D:
  print('Yes')
else:
  print('No')
d,s,t = map(int,input().split())
print('Yes' if d/s <= t else 'No')
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
    if row <= 0:
        return [[] for _ in range(col)]
    elif col == 1:
        return [I() for _ in range(row)]
    else:
        read_all = [LI() for _ in range(row)]
        return map(list, zip(*read_all))

#################

D,T,S = LI()

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

if T * S >= D:
    print('Yes')
else:
    print('No')
D,T,S=map(int,input().split())
if S*T<D:
    print("No")
else:
    print("Yes")
D, T, S = map(int, input().split(' '))
if T*S >= D:
    print("Yes")
else:
    print("No")
d, t, s = map(int, input().split())
time = d / s
if time <= t:
    print('Yes')
else:
    print('No')
D,T,S = map(int, input().split())
X = D/S
if X > T:
  print('No')
else:
  print('Yes')
D,T,S=(int(x) for x in input().split())

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

if s * t >= d:
    print("Yes")
else:
    print("No")
D,T,S = map(int,input().split())
if D/S <= T:
    print("Yes")
elif D/S > T:
    print("No")
d, t, s = (int(each) for each in input().split())
if s * t >= d:
    print('Yes')
else:
    print('No')