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,s,t = map(int, input().split())

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

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

ans = d / s

if ans > 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 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 = list(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('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(i) for i in input().split()]

if(s*t >= 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):
a,b,c=map(int,input().split())
if (b*c >= a):
	print('Yes')
else:
	print('No')

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


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

Solution (Python):
print('Yes' if eval(input().replace(' ','<=',1).replace(' ','*',1)) else '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):
def main():
    d,t,s=map(int,input().split())
    print("Yes" if d/s<=t else "No")
    
if __name__ == "__main__":
    main()

Solution (Python):
def func(D,T,S):
  actualTime = D / S
  if actualTime <= T:
    return "Yes"
  else:
    return "No"


if __name__ == "__main__":
    inputStr = input().split(' ')
    D = int(inputStr[0])
    T = int(inputStr[1])
    S = int(inputStr[2])
    print(func(D,T,S))

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

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

Solution (Python):


class main:
  def judge(d, x):
    if d <= x:
      print("Yes")
    else:
      print("No")

if __name__ == "__main__":
  d, t, s = map(int, input().split())
  dis = t * s
  main.judge(d,dis)

Solution (Python):


import sys

input = iter(sys.stdin.read().splitlines()).__next__

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

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

print("YNeos"[a/c > b::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/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):
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())
print('Yes' if d <= t*s else '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 s*t>=d:
    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())
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('No')
else:
    print('Yes')

Solution (Python):
a,b,c=map(int,input().split());print('YNeos'[a/b>c::2])

Solution (Python):

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

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline




'''
a=[]
b=[]
for i in range():
    A, B = map(int, input().split())
    a.append(A)   
    b.append(B)'''
import math
d,t,s=map(int, input().split())
if math.ceil(d/t)>s:
    print("No")
else: print("Yes")

Solution (Python):
from sys import stdin, stdout, setrecursionlimit
from collections import deque, defaultdict, Counter
from heapq import heappush, heappop
from functools import lru_cache
import math


rl = lambda: stdin.readline()
rll = lambda: stdin.readline().split()
rli = lambda: map(int, stdin.readline().split())
rlf = lambda: map(float, stdin.readline().split())

INF, NINF = float('inf'), float('-inf')
MOD = 10**9 + 7

def main():
	d, t, s = rli()
	x = d/s 
	print("Yes" if x <= t else "No")
	stdout.close()

if __name__ == "__main__":
	main()

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

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

Solution (Python):
import sys,bisect,string,math,time,functools,random,fractions
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
rep=range;R=range
def Golf():n,*t=map(int,open(0).read().split())
def I():return int(input())
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def MI():return map(int,input().split())
def LI():return [int(i) for i in input().split()]
def LI_():return [int(i)-1 for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def NLI(n):return [[int(i) for i in input().split()] for i in range(n)]
def NLI_(n):return [[int(i)-1 for i in input().split()] for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def RA():return map(int,open(0).read().split())
def RLI(n=8,a=1,b=10):return [random.randint(a,b)for i in range(n)]
def RI(a=1,b=10):return random.randint(a,b)
def Rtest(T):
    case,err=0,0
    for i in range(T):
        inp=INP()
        a1,ls=naive(*inp)
        a2=solve(*inp)
        if a1!=a2:
            print((a1,a2),inp)
            err+=1
        case+=1
    print('Tested',case,'case with',err,'errors')
def GI(V,E,ls=None,Directed=False,index=1):
    org_inp=[];g=[[] for i in range(V)]
    FromStdin=True if ls==None else False
    for i in range(E):
        if FromStdin:
            inp=LI()
            org_inp.append(inp)
        else:
            inp=ls[i]
        if len(inp)==2:
            a,b=inp;c=1
        else:
            a,b,c=inp
        if index==1:a-=1;b-=1
        aa=(a,c);bb=(b,c);g[a].append(bb)
        if not Directed:g[b].append(aa)
    return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'
    
    mp=[boundary]*(w+2);found={}
    for i in R(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[boundary]+[mp_def[j] for j in s]+[boundary]
    mp+=[boundary]*(w+2)
    return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def accum(ls):
    rt=[0]
    for i in ls:rt+=[rt[-1]+i]
    return rt
def bit_combination(n,base=2):
    rt=[]
    for tb in R(base**n):s=[tb//(base**bt)%base for bt in R(n)];rt+=[s]
    return rt
def gcd(x,y):
    if y==0:return x
    if x%y==0:return y
    while x%y!=0:x,y=y,x%y
    return y
def YN(x):print(['NO','YES'][x])
def Yn(x):print(['No','Yes'][x])
def show(*inp,end='\n'):
    if show_flg:print(*inp,end=end)

mo=10**9+7

inf=float('inf')
FourNb=[(-1,0),(1,0),(0,1),(0,-1)];EightNb=[(-1,0),(1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('WENS',FourNb));cursol=dict(zip('LRUD',FourNb))
l_alp=string.ascii_lowercase

read=sys.stdin.buffer.read;readline=sys.stdin.buffer.readline;input=lambda:sys.stdin.readline().rstrip()

show_flg=False
show_flg=True

ans=0


d,t,s=LI()
Yn(t*s>=d)

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 t * s >= d else "No")

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

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

ans = d / s

if ans > t:
   print('No')
elif ans < t or ans == t:
   print('Yes')

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

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

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

if int(text[1]) * int(text[2]) >= int(text[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:
    ans = 'No'
print(ans)

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    s = input()
    return(list(s[:len(s) - 1]))
def invr():
    return(map(int,input().split()))

a,b,c = inlt()
if a/c <= b:
    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 / s <= t:
    print('Yes')
    exit()
else:
    print('No')
    exit()

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
d, t, s = M()
if d/s <= t:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

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


if __name__ == "__main__":
    main()

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 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,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 d/s<=t else print("No")

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

x = t*s

if d <= x:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
import copy
import math
import time
import statistics
import math
import itertools
import bisect
import sys
from decimal import *
from collections import deque


def get_int():
    return int(input())

def get_string():
    return input()

def get_int_list():
    return [int(x) for x in input().split()]

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

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

def get_string_char_list():
    return list(str(input()))



sys.setrecursionlimit(10 ** 6)

def main():
    start = time.time()

    d, t, s = get_int_multi()
    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 t*s < d:
    print("No")
else:
    print("Yes")

Solution (Python):
dis, limit, speed = map(int, input().split())
time = dis / speed
judge = 'Yes' if time <= limit else 'No'
print(judge)

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

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

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

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

Solution (Python):
str = input()
str = [int(x) for x in str.split()]

if(str[0] <= str[1] * str[2]):
  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/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())
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())
a = d - t * s
if a <= 0:
    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())
print("No" if t*s < d else"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 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):
l = list(map(int, input().split()))
d = l[0]
t = l[1]
s = l[2]
if t*s < 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):
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 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 = input().split()
d = int(d)
t = int(t)
s = int(s)
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):

from collections import defaultdict 
import sys
import math 

def get_array(): return list(map(int , sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()


(d,t,s)= get_ints()

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

Solution (Python):
a = input().split()
a_num = [int(i) for i in a]

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

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

Solution (Python):
string = input()
val = string.split()
D = float(val[0])
T = float(val[1])
S = float(val[2])

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

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

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

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

Solution (Python):



import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

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

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

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

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

distance = T * S

if D <= distance:
  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())

dist = t * s

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

Solution (Python):
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())
a = d - s*t
if a<=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):
input_line = list(input().split())
input_line = [int(n) for n in input_line]
 
[D, T, S] = input_line
condition = D <= T*S
if condition:
    print("Yes")
else:
    print("No")

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

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

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

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

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

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

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

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

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

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

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

else:
	print("No")

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

Dist = s*t

if d <= Dist:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
import bisect, copy, heapq, math, sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
def celi(a,b):
    return -(-a//b)
sys.setrecursionlimit(5000000)
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]

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 t*s>=d else 'No')

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

Solution (Python):
D,T,S = list(map(int, input().split()))
print("Yes" if D <= T*S else "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 <= 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 = [float(i) for i in input().split()]
if d/s > t:
  print('No')
else:
  print('Yes')

Solution (Python):
line = input().split(' ')
D = float(line[0])
T = float(line[1])
S = float(line[2])

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

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

Solution (Python):
import sys
input = sys.stdin.readline


def read():
    D, T, S = map(int, input().strip().split())
    return D, T, S


def solve(D, T, S):
    if S * T >= D:
        return "Yes"
    return "No"


if __name__ == '__main__':
    inputs = read()
    outputs = solve(*inputs)
    if outputs is not None:
        print("%s" % str(outputs))

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

Solution (Python):

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

print("Yes" if D/(S*T)<=1 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 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("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):
A = input().split()

B = int(A[1]) * int(A[2])

if int(A[0]) <= B:
  print("Yes")
else:
  print("No")

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

if __name__ == "__main__":
    main()

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

main()

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 t*s >= d else '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 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):
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

d,t,s = map(int,input().split())
m  = t * s
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 print("No")

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

Solution (Python):
x,y ,z= map(int,input().split())
ans=x/z
if ans<=y:
	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):
a,b,c = map(int,input().split())
print('Yes') if a <= b*c 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())

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