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

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

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

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

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

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

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

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

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

Solution (Python):
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("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 t >= d/float(s):
    print("Yes")
else:
    print("No")

Solution (Python):
D, T, S = [int(_) for _ in input().split()]
print('Yes' if S * T >= D else 'No')

Solution (Python):
data = input()
n = [int(x) for x in data.split()]
if n[1] * n[2] < n[0]: 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 = 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('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())
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):
import sys

sys.setrecursionlimit(10 ** 8)

input = sys.stdin.readline


def main():
    D, T, S = [int(x) for x in input().split()]
    if T * S >= D:
        print("Yes")
    else:
        print("No")

    

if __name__ == '__main__':
    main()

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

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


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())
eq= d/s
if eq <= 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):

meters, minutes, metersPerMinute = map(int, input().split())

willReach = meters <= metersPerMinute * minutes

if willReach:
    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, bisect, math, itertools, string, queue, copy
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inl = lambda: [int(x) for x in sys.stdin.readline().split()]
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))


def solve():
    d, t, s = inl()
    return s * t >= d


print("Yes" if solve() else "No")

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

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

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

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

Solution (Python):

def fact(x):
	if x == 0:
		return 1
	else:
		return x * fact(x-1)
def lower_bound(li, num): 
	answer = -1
	start = 0
	end = len(li)-1

	while(start <= end):
		middle = (end+start)//2
		if li[middle] >= num:
			answer = middle
			end = middle - 1
		else:
			start = middle + 1
	return answer 
def upper_bound(li, num): 
	answer = -1
	start = 0
	end = len(li)-1

	while(start <= end):
		middle = (end+start)//2

		if li[middle] <= num:
			answer = middle
			start = middle + 1
		
		else:
			end = middle - 1
	return answer 

def abs(x):
	return x if x >=0 else -x
def binary_search(li, val, lb, ub): 
	ans = 0
	while(lb <= ub):
		mid = (lb+ub)//2
		
		if li[mid] > val:
			ub = mid-1
		elif val > li[mid]:
			lb = mid + 1
		else:
			ans = 1
			break
	return ans
def kadane(x): 
	sum_so_far = 0
	current_sum = 0
	for i in x:
		current_sum += i
		if current_sum < 0:
			current_sum = 0
		else:
			sum_so_far = mpos(sum_so_far,current_sum)
	return sum_so_far
def pref(li):
	pref_sum = [0]
	for i in li:
		pref_sum.append(pref_sum[-1] + i)
	return pref_sum


'''
      ▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄
   ▄███████▀▀▀▀▀▀███████▄
░▐████▀▒▒Aestroix▒▒▀██████
░███▀▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▀████
░▐██▒▒▒▒▒KARMANYA▒▒▒▒▒▒████▌         ________________
░▐█▌▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒████▌  ? ?   |▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒|
░░█▒▒▄▀▀▀▀▀▄▒▒▄▀▀▀▀▀▄▒▒▐███▌   ?    |___CM ONE DAY___|
░░░▐░░░▄▄░░▌▐░░░▄▄░░▌▒▐███▌     ? ? |▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒|
░▄▀▌░░░▀▀░░▌▐░░░▀▀░░▌▒▀▒█▌    ? ?    
░▌▒▀▄░░░░▄▀▒▒▀▄░░░▄▀▒▒▄▀▒▌      ? 
░▀▄▐▒▀▀▀▀▒▒▒▒▒▒▀▀▀▒▒▒▒▒▒█     ? ? 
░░░▀▌▒▄██▄▄▄▄████▄▒▒▒▒█▀       ? 
░░░░▄█████████ ████=========█▒▒▐▌
░░░▀███▀▀████▀█████▀▒▌
░░░░░▌▒▒▒▄▒▒▒▄▒▒▒▒▒▒▐
░░░░░▌▒▒▒▒▀▀▀▒▒▒▒▒▒▒▐
░░░░░████████████████
'''
from math import *

for _ in range(1):
	
	
	d,t,s = map(int,input().split())
	
	
	
	
	
	
	
	
	
	if d/s > t:
		print('No')
	else:
		print('Yes')

Solution (Python):
D,T,S = map(float,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 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())
print('YNeos'[d>t*s::2])

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

Solution (Python):

import collections
from functools import lru_cache
import bisect

INF = float("inf")
ZERO = 0
ONE = 1


def read():
    return input().strip()


def readInt():
    return int(input().strip())


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


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


D, T, S = readList()
print("Yes" if solve(D, T, S) else "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 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=(int(i) for i in input().split())
if(s*t>=d):
  print("Yes")
else:
  print("No")

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

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

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

temp = d/s
if temp<=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())
print('NYoe s'[d<=t*s::2])

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

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

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

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

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

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

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

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


def solve(D: int, T: int, S: int):

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




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

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

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

if D > T * S:
	print("No")
elif D == T * S:
	print("Yes")
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 = [int(i) for i in input().split()]
print('Yes' if T * S >= D  else 'No')

Solution (Python):
D,T,S = [int(i) for i in input().split()]
out = 'Yes' if D <= T * S else 'No'
print(out)

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):
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


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


if __name__ == '__main__':
    solve()

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

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

Solution (Python):
if __name__ == "__main__":
    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("YNeos"[d/s>t::2])

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

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

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

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

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

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

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

Solution (Python):
td,tm,dpm =tuple(map(int,input().split(" ")))
if td/dpm <= tm:
    print("Yes")
else:
    print("No")

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

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

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

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

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

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=input().split()
if(float(T)>=(float(D)/float(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):
a = input()

w = a.split(" ")

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

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

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

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

time = D / S

if T >= time:
  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 = [int(s) for s in input().split()]
if a[0] / a[2] <= a[1]:
  print("Yes")
else:
  print("No")

Solution (Python):
import sys


stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(stdin.readline().rstrip())
def nm(): return map(int, stdin.readline().split())
def nl(): return list(map(int, stdin.readline().split()))


def main():
    d, t, s = nm()
    if d / s <= t:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Solution (Python):


def get_input() -> tuple:
    """
    標準入力を取得する.

    Returns:\n
        tuple: 標準入力
    """
    D, T, S = list(map(int, input().split()))

    return D, T, S


def main(D: int, T: int, S: int) -> None:
    """
    メイン処理.

    Args:\n
        D (int): 待ち合わせ場所(1 <= D <= 10000)
        T (int): 待ち合わせ時間(1 <= T <= 10000)
        S (int): 分速(1 <= S <= 10000)
    """
    
    ans = str()
    if D <= S * T:
        ans = "Yes"
    else:
        ans = "No"

    
    print(ans)


if __name__ == "__main__":
    
    D, T, S = get_input()

    
    main(D, T, S)

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

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

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

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

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

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

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

Solution (Python):
def main():

    d,t,s = tuple([int(t)for t in input().split()])

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

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

Solution (Python):
import base64
import subprocess


exe_bin = "e??420s

exe_bin = base64.b85decode(exe_bin)

with open("./kyomu", 'wb') as f:
    f.write(exe_bin)

subprocess.run(["chmod +x ./kyomu"], shell=True)
subprocess.run(["./kyomu"], shell=True)

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


if __name__ == '__main__':
    main()

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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())


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

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

Solution (Python):
import math
import collections
import fractions
import itertools
import functools
import operator
import bisect

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

if __name__ == "__main__":
    solve()

Solution (Python):
d,t,s = map(int,input().split())
t1 = d/s
if t1 <= 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):
import sys
INF = 1 << 60
MOD = 10**9 + 7 
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
    d, t, s = map(int, input().split())
    if d <= t * s:
        print("Yes")
    else:
        print("No")
resolve()

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

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

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

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'[d>t*s::2])

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

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

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

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

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

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

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

Solution (Python):
A=list(input().split())

if int(A[0])<=int(A[1])*int(A[2]):
  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):
i = list(map(int, input().split()))
print("Yes" if i[0]<=i[1]*i[2] else "No")

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

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

Solution (Python):
import sys

input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]

tin=lambda : map(int, input().split())
lin=lambda : list(tin())
mod=1000000007



def main():
	
	d, t, s = tin()
	
	return 'Yes' if d <= t*s else 'No'
	
	

isTest=False

def pa(v):
	if isTest:
		print(v)
		
def input_clipboard():
	import clipboard
	input_text=clipboard.get()
	input_l=input_text.splitlines()
	for l in input_l:
		yield l

if __name__ == "__main__":
	if sys.platform =='ios':
		if input_method==input_methods[0]:
			ic=input_clipboard()
			input = lambda : ic.__next__()
		elif input_method==input_methods[1]:
			sys.stdin=open('inputFile.txt')
		else:
			pass
		isTest=True
	else:
		pass
		
			
	ret = main()
	if ret is not None:
		print(ret)

Solution (Python):
from sys import stdin
import math

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

ans = d / s

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

Solution (Python):
a=input()
aa=a.split()
d=int(aa[0])
t=int(aa[1])
s=int(aa[2])
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 = [int(x) for x in input().split()]
print('Yes' if t >= d / s else 'No')

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

q, mod = divmod(d, s)

if mod ==0:
    if q <=t:
        print("Yes")
    else:
        print("No")
elif q+1 <= t:
    print("Yes")
else:
    print("No")

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

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

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

Solution (Python):
x, y, z = map(int, input().split())
if x/z <= y:
	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):
input_line = input().split()
m = int(input_line[0])
t = int(input_line[1])
s = int(input_line[2])
 
time = 0
if ( m % s == 0 ):
    time = m / s
else:
    time = (m / s) + 1
 
if ( int(time) <= t ):
	print("Yes")
else:
	print("No")

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

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

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

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

x = D/S

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

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float("INF")


def solve():
    d, t, s = LI()
    if t * s >= d:
        print("Yes")
    else:
        print("No")
    return



if __name__ == '__main__':
    solve()

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
input_text = input()
input_text = input_text.split(" ")
list_int = []
for _ in input_text:
    list_int.append(int(_))

distance = list_int[2] * list_int[1]
if distance >= list_int[0]:
    reslut = "Yes"        
else:
    reslut = "No"


print(reslut)

Solution (Python):
d, t ,s = list(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())

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

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

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

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

D = x[0]
T = x[1]
S = x[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):
import math
varies = input().split(' ')
D = int(varies[0])
T = int(varies[1])
S = int(varies[2])
if math.ceil(D / S) <= T:
  print('Yes')
else:
  print('No')

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

Solution (Python):





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




x = d / (1.0 * s)

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

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

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

Solution (Python):
D, T, S = map(int, input().split())
print('No' if (D / T) > S else '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 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, s, t = [int(s) for s in 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 / 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):
dist, t_fun, s_hayasa = map(int, input().split())

kyori = t_fun * s_hayasa

if (kyori >= dist):
    print('Yes')
else:
    print('No')

Solution (Python):

"""
Created on Sat Aug 29 21:05:56 2020

@author: naoki
"""

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

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