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 * 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
read = sys.stdin.read
readlines = sys.stdin.readlines

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


from typing import *
import collections
import functools as fts
import itertools as its
import math
import sys

INF = float('inf')
YES = "Yes"  
NO = "No"  


def solve(D: int, T: int, S: int):
    return [NO, YES][D/S <= T]


def main():

    sys.setrecursionlimit(10 ** 6)

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    D = int(next(tokens))  
    T = int(next(tokens))  
    S = int(next(tokens))  
    print(f'{solve(D, T, S)}')


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

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

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

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

if D / S <= 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):
x, y, z = map(int, input().split())

if y*z >= x:
	print("Yes")
else:
	print("No")

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

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

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

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

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


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

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

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

Solution (Python):

import sys, math, heapq
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial, gcd
from bisect import bisect_left, bisect_right

sys.setrecursionlimit(10 ** 7)
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep="\n")

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

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

Solution (Python):

str_in = input()
num = [int(n) for n in str_in.split()]
num =list(map(int, str_in.strip().split()))  



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

Solution (Python):

str_in = input()
num = [int(n) for n in str_in.split()]
num =list(map(int, str_in.strip().split()))  



if num[1] > (num[0]/num[2]):
    print("Yes")
elif num[1] == (num[0]/num[2]):
    print("Yes")
else:
    print("No")

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

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

Solution (Python):

from sys import stdin
input = stdin.readline
MOD = 10**9+7

def main():
    D, T, S = list(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/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())

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

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

min = d / s

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

Solution (Python):



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

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


main()

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

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

Solution (Python):
def dts():
	return list(map(int,input().split()))

d,t,s=dts()

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

Solution (Python):





















import math
import copy
import string



INF = int(10**18) 
pi = math.pi

MOD = 1000000007








def my_pow(N, a, M):
    if(a == 0):
        return 1
    else:
        if(a % 2 == 0):
            tempo = my_pow(N, a/2, M)
            return (tempo * tempo) % M
        else:
            tempo = my_pow(N, a - 1, M)
            return (tempo * N) % M





def my_combination(N, a, M):
    res = 1

    for i in range(0, a):
        res *= N - i
        res %= M

    for i in range(0, a):
        res *= my_pow(i + 1, M - 2, M)
        res %= M

    return res





def my_combination_table(N, M, v):
    if(len(v) < N + 1):
        l = N + 1 - len(v)
        tempo = [1] * l
        v.extend(tempo)

    for i in range(1, N + 1):
        v[i] = v[i - 1] * (N - (i - 1))
        v[i] %= M

        v[i] *= my_pow(i, M - 2, M)
        v[i] %= M

    return












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

Solution (Python):

def inputlist(): return [int(j) for j in input().split()]

"""
H,W = inputlist()
st = inputlist()
gl = inputlist()
maze = ['0']*H
for i in range(H):
    maze[i] = list(input())
table = [[10**9+7]*W for _ in range(H)]

"""
D,T,S = inputlist()
time = D//S + int(D%S != 0)
if time <= T:
    print("Yes")
else:
    print("No")

Solution (Python):

def inputlist(): return [int(j) for j in input().split()]

"""
H,W = inputlist()
st = inputlist()
gl = inputlist()
maze = ['0']*H
for i in range(H):
    maze[i] = list(input())
table = [[10**9+7]*W for _ in range(H)]

"""
D,T,S = inputlist()
time = D//S + int(D%S != 0)
if time <= T:
    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())

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


print(ans)

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


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

Solution (Python):
from sys import stdin

input = stdin.readline

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

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

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

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

Solution (Python):



YES = 'Yes'
NO = 'No'


def solve(D, T, S):
    return S * T >= D


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

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

Solution (Python):

from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify

import itertools
import math, fractions
import sys, copy

def L(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline().rstrip())
def SL(): return list(sys.stdin.readline().rstrip())
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI1(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS(): return [list(x) for x in sys.stdin.readline().split()]
def R(n): return [sys.stdin.readline().strip() for _ in range(n)]
def LR(n): return [L() for _ in range(n)]
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def LIR1(n): return [LI1() for _ in range(n)]
def SR(n): return [SL() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]

def perm(n, r): return math.factorial(n) // math.factorial(r)
def comb(n, r): return math.factorial(n) // (math.factorial(r) * math.factorial(n-r))

def make_list(n, *args, default=0): return [make_list(*args, default=default) for _ in range(n)] if len(args) > 0 else [default for _ in range(n)]

dire = [[1, 0], [0, 1], [-1, 0], [0, -1]]
dire8 = [[1, 0], [1, 1], [0, 1], [-1, 1], [-1, 0], [-1, -1], [0, -1], [1, -1]]
alphabets = "abcdefghijklmnopqrstuvwxyz"
ALPHABETS = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
MOD = 1000000007
INF = float("inf")

sys.setrecursionlimit(1000000)

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

if __name__ == '__main__':
    main()

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

Solution (Python):
def ap_in_time(distance, time_for_ap, speed) -> str:
    return 'Yes' if distance <= time_for_ap * speed else 'No'


if __name__ == '__main__':
    a, b, c = map(int, input().split())
    print(ap_in_time(a, b, c))

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

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

Solution (Python):
a = input().rstrip().split(" ")
distance = int(a[0])
deadline = int(a[1])
speed = int(a[2])
if distance / speed > deadline:
  print("No")
else:
  print("Yes")

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

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

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

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

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

main()

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

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

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

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

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

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

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

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

Solution (Python):
import numpy as np

sts = input()

st = sts.split(' ')
d = int(st[0])
t = int(st[1])
s = int(st[2])





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

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

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

x = D / S

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

Solution (Python):
def main(D, T, S):
    time = D//S
    if D%S != 0:
        time += 1
    if time <= T:
        return 'Yes'
    else:
        return 'No'

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

Solution (Python):
from sys import stdin
def ip():
    return stdin.readline().rstrip()
d,t,s=map(int,ip().split())
if d<=t*s:
    print('Yes')
else:
    print('No')

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

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

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

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

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


def calculate(d, t, s):

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


calculate(D, T, S)

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

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

Solution (Python):
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    d, t, s = list(map(int, readline().split()))
    print("Yes" if d <= t * s else "No")


if __name__ == '__main__':
    solve()

Solution (Python):
d=input()
arr = [int(i) for i in d.split()]

t1 = arr[0]/arr[-1]
if t1<= arr[1]:
  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(float,input().split())


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

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

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

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

t_2 = d/s

if(t >= t_2):
    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 = [int(x) for x in input().split()]
print("Yes" if d <= t * s else "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 = list(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('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):
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 = map(int, input().split())

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


if __name__ == '__main__':
    main()

Solution (Python):

import sys


def resultSur97(x):
    return x % (10 ** 9 + 7)


if __name__ == '__main__':
    
    aList = list(map(int, input().split()))     


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

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

d, t, s = read()

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

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

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

Solution (Python):
import math

li=list(map(int,input().split()))

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

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

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

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

Solution (Python):
a,b,c=map(int, input().split())
A=(b*c)
if A>a:
    print('Yes')
elif A==a:
    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):
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(map(int, input().split()))

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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


if __name__ == '__main__':
    main()

Solution (Python):

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

Solution (Python):

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

Solution (Python):
def LI():return list(map(int,input().split()))
def II():return int(input())
def yes():return print("Yes")
def no():return print("No")








class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        
        
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

class Unionfind:
    def __init__(self, N):
        self.p = list(range(N))
        self.rank = [0] * N
        self.size = [1] * N

    def root(self, x):
        if self.p[x] != x:
            self.p[x] = self.root(self.p[x])

        return self.p[x]

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

    def unite(self, x, y):
        u = self.root(x)
        v = self.root(y)

        if u == v: return

        if self.rank[u] < self.rank[v]:
            self.p[u] = v
            self.size[v] += self.size[u]
            self.size[u] = 0
        else:
            self.p[v] = u
            self.size[u] += self.size[v]
            self.size[v] = 0

            if self.rank[u] == self.rank[v]:
                self.rank[u] += 1

    def count(self, x):
        return self.size[self.root(x)]


d,t,s=LI()

if (d<=t*s):
    yes()
else:
    no()

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


def solve(D: int, T: int, S: int):
    if T >= D/S:
        print(YES)
    else:
        print(NO)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    D = int(next(tokens))  
    T = int(next(tokens))  
    S = int(next(tokens))  
    solve(D, T, S)

if __name__ == '__main__':
    main()

Solution (Python):
def LI():return list(map(int,input().split()))
def II():return int(input())
def yes():return print("Yes")
def no():return print("No")
INF=float("inf")
from collections import deque, defaultdict, Counter
from heapq import heappop, heappush
from itertools import product, combinations
from functools import reduce, lru_cache
from math import pi, gcd
from decimal import Decimal

class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        
        
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

class Unionfind:
    def __init__(self, N):
        self.p = list(range(N))
        self.rank = [0] * N
        self.size = [1] * N

    def root(self, x):
        if self.p[x] != x:
            self.p[x] = self.root(self.p[x])

        return self.p[x]

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

    def unite(self, x, y):
        u = self.root(x)
        v = self.root(y)

        if u == v: return

        if self.rank[u] < self.rank[v]:
            self.p[u] = v
            self.size[v] += self.size[u]
            self.size[u] = 0
        else:
            self.p[v] = u
            self.size[u] += self.size[v]
            self.size[v] = 0

            if self.rank[u] == self.rank[v]:
                self.rank[u] += 1

    def count(self, x):
        return self.size[self.root(x)]


d,t,s=LI()

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

Solution (Python):

from typing import *

YES = 'Yes'
NO = 'No'


def solve(D, T, S):
    return YES if D <= T*S else NO
    

def main():
    D, T, S = map(int, input().split())
    a = solve(D, T, S)
    print(a)

if __name__ == '__main__':
    main()