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

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

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

Solution (Python):
a = list(map(int, input().split()))
d= a[0]
t= a[1]
s= a[2]

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

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

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

Solution (Python):



s = input()
a = s.split()

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

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

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

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

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

Solution (Python):
inputArr = input().split(" ")
check = int(inputArr[2]) - (int(inputArr[0]) / int(inputArr[1]))
if check >= 0:
    print('Yes')
else:
    print('No')

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

Solution (Python):
d, t, s = list(map(lambda x: int(x), 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):
input_data = input()

D = float(input_data.split(" ")[0])
T = float(input_data.split(" ")[1])
S = float(input_data.split(" ")[2])

time = D/S

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

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

    min = D / S

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

if __name__ == "__main__":
    solve()

Solution (Python):
from sys import stdin

D, T, S = [int(x) for x in stdin.readline().rstrip().split()]

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

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

Solution (Python):



def get_int_args():
    args = input().split()
    return list(map(int, args)), len(args)


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


if __name__ == '__main__':
    a, b, c = tuple(get_int_args()[0])
    if (a <= b * c):
        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):
def main():
    d, t, s = map(int, input().split())
    print('Yes' if d / s <= t else 'No')


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

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

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

t = S[0]/S[2]

if t <= S[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):
range,time,speed = map(int, input().split())
if time >= range/speed:
    print("Yes")
else:
    print("No")

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


    q = d/s

    if t < q:
        print("No")
    else:
        print("Yes")

Solution (Python):
import sys
import  math
import fractions
from collections import defaultdict
stdin = sys.stdin
     
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

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

Solution (Python):
d,t,s=map(float, raw_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):
a = list(map(int,input().split()))
syoyou = a[0]/a[2]
if syoyou <= a[1]:
    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())
add = 0
for i in range(T):
  add += S
  if add >= D:
    print('Yes')
    exit()
print('No')

Solution (Python):


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

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

TT = round(D / S, 5)

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

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

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

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

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

Solution (Python):
d, t, s = map(int, input().split())
dist = 0
time = 0
while dist < d and time<=t:
    dist += s
    time += 1
if time > 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/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/s <= t else 'No')

Solution (Python):
input_n = input()
n = str(input_n)


listN = n.split(' ')

distance = int(listN[0])
time = int(listN[1])
speed = int(listN[2])

if (distance / speed) <= time:
    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())

a = T * S - D
if a >= 0:
    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):
def NextInts(): return map(int,input().split())

D,T,S = NextInts()

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

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

Solution (Python):
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

d, t, s = map(int, read().split())
ok = s * t >= d
print('Yes' if ok 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(S*T>=D):
  print('Yes')
else:
  print('No')

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

Solution (Python):
D,T, S = map(float, 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):
inputValue=input()

l=inputValue.split(" ")
D=int(l[0])
T=int(l[1])
S=int(l[2])

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

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

s = l[0]/l[2]

if s <= l[1]:
  print("Yes")
else:
  print("No")

Solution (Python):
arr=[int(i) for i in input().split()]
if(arr[0]/arr[2]<=arr[1]):
  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())

num=t*s

if num>=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 = (int(x) for x in input().split())
print('Yes' if s*t >= d else 'No')

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

Solution (Python):
strd,strt,strs =  input().split()

d = int(strd)
t = int(strt)
s = int(strs)

yesno = 'Yes'

if d > t * s:
  yesno = 'No'

print(yesno)

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 sys
from collections import deque
import bisect
import copy
import heapq
import itertools
import math
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 10 ** 9 + 7

def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for n in range(N)]


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


if __name__ == "__main__":
    main()

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

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

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

for i in range(3):
    str[i] = int(str[i])

a = float(str[0] / str[2])

if a <= str[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())
x=s*t-d
if x>=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):
import sys

def main():

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

if __name__ == "__main__":
    main()

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

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

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

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

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=list(map(int,input().strip().rsplit()))
if(a[0]/a[2]<=a[1]):
    print("Yes")
else:
    print("No")

Solution (Python):
dts = input().split()
if int(dts[1])*int(dts[2]) >= int(dts[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 = list(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):
import sys

a = input().split()

b = int(a[0]) / int(a[2])

if b <= int(a[1]):
    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,S,T = map(int,input().split())
val = 0
for i in range(T):
    val += S
if val >= D:
    print('Yes')
else:
    print('No')

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

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

    
    l_list = list(map(int, input().split()))
    d = l_list[0]
    t = l_list[1]
    s = l_list[2]

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


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

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("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):
import numpy as np

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

o = d / s
if o <= t:
    o = 'Yes'
else:
    o = 'No'

print(o)

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

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

Solution (Python):

if __name__ == '__main__':
    a = list(map(int, input().rstrip().split()))
    if (a[0]/a[2])>a[1]:
      print('No')
    else:
      print('Yes')

Solution (Python):
d, t, s = map(int, input().split())
print("YNeos"[d/s>t::2])

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

D = i[0]
T = i[1]
S = i[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*s>=abs(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):
arr = list(map(int, input().rstrip().split()))
D = arr[0]
T = arr[1]
S = arr[2]
if (D/T)<=S:
  print("Yes")
else:
  print("No")

Solution (Python):
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


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

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

ts = d / s
diff = ts - t
if diff > 0:
  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())
D1=T*S
if(D1>=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(i) for i in input().split()]
if (d/s<=t):
    print("Yes")
else:
    print("No")

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

targetPos = D_T_S[0]
time_Limit = D_T_S[1]
velocity = D_T_S[2]

arrival_time = targetPos / velocity
if (arrival_time > time_Limit):
    print("No")
else:
    print("Yes")

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

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

Solution (Python):
def resolve():
    d, t, s = list(map(int, input().split()))
    if s * t >= d:
        print('Yes')
        return

    print('No')
resolve()

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

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

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

Solution (Python):
D, T, S = [int(x) for x in input().split()]
t = (D - 1) // S + 1
if t > T:
    print('No')
else:
    print('Yes')

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

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

main()

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

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

D, T, S = LI()


def main():
    x = (D - 1) // S + 1
    ans = "Yes" if x <= T else "No"
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
d, t, s = [list(map(int, s.split())) for s in open(0)][0]
if t >= d/s:
    print('Yes')
else:
    print('No')

Solution (Python):
n , m, p = map(int, input().split())

if n/p <= m:
    print("Yes")
else:
    print('No')

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

Solution (Python):
row = input().split()
dist = int(row[0])
time_meet = int(row[1])
speed = int(row[2])

time_need = dist / speed
if time_need <= time_meet:
    print('Yes')
else:
    print("No")

Solution (Python):
d, t, s = map(int, input().split())
ok = d / s <= t
if ok:
    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 (x) for x in input().split()]

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

Solution (Python):
def main():
  user_in = input("")

  D, T, S = user_in.split(" ")
  need_time = float(D) / float(S)
  
  if(need_time <= int(T)):
  	print("Yes")
  else:
  	print("No")
  
 
if __name__ == "__main__":
  main()

Solution (Python):

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

ret = 'No'
if s * t >= d:
    ret = 'Yes'

print(ret)

Solution (Python):
import sys
import 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_map()
    time = 0
    if D%S == 0 :
        time = D//S
    else:
        time = D//S+1

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

    return

if __name__ == '__main__':
    main()

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


def main():
    [d, t, s] = [int(e) for e in si().split()]
    if d <= t*s:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

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

Solution (Python):
input1 = input()
input1 = input1.split()
D, T, S = int(input1[0]), int(input1[1]), int(input1[2])
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,m,s = map(int,input().split())
if(d/s <= m):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())

cost_t = D  / S
if T >= cost_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):
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):
import sys
input = sys.stdin.readline


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

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

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

if t >= r:
    print('Yes')
else:
    print('No')

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

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

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

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

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

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


elapsed_time = d / s

if elapsed_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):
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 and D % S == 0:
  print("Yes")
elif D//S<T:
  print("Yes")
else:
  print("No")

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

meter = int(inputs[0])
limit_minutes = int(inputs[1])
speed = int(inputs[2])

if meter > limit_minutes * speed:
    print("No")
else:
    print("Yes")

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

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

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


dont_be_late()

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