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):
import bisect
import sys,io
import math
from collections import deque
from heapq import heappush, heappop

input = sys.stdin.buffer.readline

def sRaw():
    return input().rstrip("\r")


def iRaw():
    return int(input())


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


def isRaw():
    return list(map(int, ssRaw()))

INF = 1 << 29

DIV = (10**9) + 7


def mod_inv_prime(a, mod=DIV):
    return pow(a, mod-2, mod)


def mod_inv(a, b):
    r = a
    w = b
    u = 1
    v = 0
    while w != 0:
        t = r//w
        r -= t*w
        r, w = w, r
        u -= t*v
        u, v = v, u
    return (u % b+b) % b


def CONV_TBL(max, mod=DIV):
    fac, finv, inv = [0]*max, [0]*max, [0]*max
    fac[0] = fac[1] = 1
    finv[0] = finv[1] = 1
    inv[1] = 1
    for i in range(2, max):
        fac[i] = fac[i-1]*i % mod
        inv[i] = mod - inv[mod % i] * (mod//i) % mod
        finv[i] = finv[i-1]*inv[i] % mod

    class CONV:
        def __init__(self):
            self.fac = fac
            self.finv = finv
            pass

        def ncr(self, n, k):
            if(n < k):
                return 0
            if(n < 0 or k < 0):
                return 0
            return fac[n]*(finv[k]*finv[n-k] % DIV) % DIV

    return CONV()


def cumsum(As):
    s = 0
    for a in As:
        s += a
        yield s


sys.setrecursionlimit(200005)


def dijkstra(G,start=0):
    heap = []
    cost = [INF]*len(G)
    heappush(heap,(0,start))
    while len(heap)!=0:
        c,n = heappop(heap)
        if cost[n] !=INF:
            continue
        cost[n]=c
        for e in G[n]:
            ec,v = e
            if cost[v]!=INF:
                continue
            heappush(heap,(ec+c,v))
    return cost


def main():
    D,T,S = isRaw()
    print("Yes" if T>=D/S else "No")

main()

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

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

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

D, T, S = map(int, readline().split())
ans = 'No'

if S*T >= D:
    ans = 'Yes'

print(ans)

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

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))  
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())  
def LS2(): return list(sys.stdin.readline().rstrip())  


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

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



import sys
from collections import defaultdict, deque
from heapq import heappush, heappop
import math
import bisect
input = sys.stdin.readline




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

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

Solution (Python):

import sys;input = sys.stdin.readline
inp,ip = lambda :int(input()),lambda :[int(w) for w in input().split()]

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)

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

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

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

Solution (Python):

import sys
sys.setrecursionlimit(10**7)
import bisect
import heapq
import itertools
import math
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from math import gcd
from operator import add, itemgetter, mul, xor
def cmb(n,r,mod):
  bunshi=1
  bunbo=1
  for i in range(r):
    bunbo = bunbo*(i+1)%mod
    bunshi = bunshi*(n-i)%mod
  return (bunshi*pow(bunbo,mod-2,mod))%mod
mod = 10**9+7
def I(): return int(input())
def LI(): return list(map(int,input().split()))
def MI(): return map(int,input().split())
def LLI(n): return [list(map(int, input().split())) for _ in range(n)]









d,t,s = MI()
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 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):
def main():
    from sys import setrecursionlimit, stdin, stderr
    from os import environ
    from collections import defaultdict, deque, Counter
    from math import ceil, floor
    from itertools import accumulate, combinations, combinations_with_replacement
    setrecursionlimit(10**6)
    dbg = (lambda *something: stderr.write("\033[92m{}\033[0m".format(str(something)+'\n'))) if 'TERM_PROGRAM' in environ else lambda *x: 0
    input = lambda: stdin.readline().rstrip()
    LMIIS = lambda: list(map(int,input().split()))
    II = lambda: int(input())
    P = 10**9+7
    INF = 10**18+10
    d,t,s = LMIIS()
    if t-d/s >= 0:
        print('Yes')
    else:
        print('No')

    
main()

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

import sys
from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right
from itertools import accumulate

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

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

if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
D, T, S = map(int, input().split())
if 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):
import sys
from collections import deque

import math

def S(): return sys.stdin.readline().rstrip()
def SL(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return map(int,sys.stdin.readline().rstrip().split())

def solve():
    return

if __name__=='__main__':
    d,t,s = IL()
    if d<=s*t:
        print("Yes")
    else:
        print("No")
    solve()

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

Solution (Python):
import sys

input = sys.stdin.readline


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


if __name__ == '__main__':
    main()

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

Solution (Python):
import sys, math
import io, os

from bisect import bisect_left as bl, bisect_right as br, insort
from heapq import heapify, heappush, heappop
from collections import defaultdict as dd, deque, Counter

def data(): return sys.stdin.readline().strip()
def mdata(): return list(map(int, data().split()))
def outl(var): sys.stdout.write(' '.join(map(str, var)) + '\n')
def out(var): sys.stdout.write(str(var) + '\n')
from decimal import Decimal


INF = float('inf')
mod = int(1e9) + 7


d,t,s=mdata()
if d/s<=t:
    out("Yes")
else:
    out("No")

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

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

Solution (Python):
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

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

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

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

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

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

Solution (Python):


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

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

Solution (Python):
from sys import stdin


def main():
    _in = [_.rstrip() for _ in stdin.readlines()]
    D, T, S = list(map(int, _in[0].split(' ')))  
    
    ans = 'Yes' if T - D/S >= 0 else 'No'
    
    print(ans)


if __name__ == "__main__":
    main()

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

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

Solution (Python):
def main():
	h,w,s = map(int,input().split())

	if h/s <= w:
		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):

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

Solution (Python):

import collections as cl
import sys


def II():
    return int(sys.stdin.readline())


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


def LI():
    return list(map(int, sys.stdin.readline().split()))


def main():
    d, t, s = MI()
    ans = "Yes" if t * s >= d else "No"
    print(ans)


main()

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

Solution (Python):



 
import sys
import math



 

fileoperation=0
if(fileoperation):
    orig_stdout = sys.stdout
    orig_stdin = sys.stdin
    inputfile = open('W:/Competitive Programming/input.txt', 'r')
    outputfile = open('W:/Competitive Programming/output.txt', 'w')
    sys.stdin = inputfile
    sys.stdout = outputfile


mod=1000000007
 

def nospace(l):
    ans=''.join(str(i) for i in l)
    return ans
 
 
 

t=1
for tt in range(t):
    
    d,t,s= map(int, sys.stdin.readline().split(' '))
    if(d<=t*s):
        print("Yes")
    else:
        print("No")
    
    
    

if(fileoperation):
    sys.stdout = orig_stdout
    sys.stdin = orig_stdin
    inputfile.close()
    outputfile.close()

Solution (Python):
import sys, os, math, bisect, itertools, collections, heapq, queue, copy, array





sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)

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


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

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


if __name__ == '__main__':
    main()

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

Solution (Python):

D,T,S = [int(i) for i in input().split()]
if T*S < D:
    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())

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

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

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10, gcd
from itertools import permutations, combinations, product, accumulate, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

from decimal import *
import heapq
def debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 1, 0, -1, 1, -1, -1, 1]
dy = [1, 0, -1, 0, 1, -1, 1, -1]
debugmode = True

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

Solution (Python):

import sys,io,os,time
from collections import defaultdict
from collections import OrderedDict
from collections import deque
from itertools import combinations
from itertools import permutations
import bisect,math,heapq
alphabet = "abcdefghijklmnopqrstuvwxyz"

input = sys.stdin.readline


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

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())
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())
print(['No','Yes'][T * S >= D])

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 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(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):
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush

sys.setrecursionlimit(10**8)
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 inplt(n): return [tuple(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()

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

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

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

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

Solution (Python):
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from collections import Counter
def main():
    d, t, s = map(int, input().split())
    dis = s * t
    if d > dis:
        print('No')
    else:
        print('Yes')

if __name__ == '__main__':
    main()

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

Solution (Python):
D,T,S = 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):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from heapq import heappush, heappop
from functools import reduce, lru_cache
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def TUPLE(): return tuple(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = 10**6
mod = 10 ** 9 + 7 

from decimal import *



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

Solution (Python):


import os,sys
from io import BytesIO, IOBase

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


BUFSIZE = 8192
class FastIO(IOBase):
    newlines = 0
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None
    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()
    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()
    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

if __name__ == '__main__':
    main()

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

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

Solution (Python):
from sys import exit
import math
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

d,t,s = mi()

if s*t < d:
    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):
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline

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

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

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

if __name__ == "__main__":
    main()

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

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

Solution (Python):
FAST_IO = 0
if FAST_IO:
    import io, sys, atexit
    rr = iter(sys.stdin.read().splitlines()).next
    sys.stdout = _OUTPUT_BUFFER = io.BytesIO()

    @atexit.register
    def write():
        sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())
else:
    rr = raw_input
rri = lambda: int(rr())
rrm = lambda: map(int, rr().split())
rrmm = lambda n: [rrm() for _ in xrange(n)]


from collections import defaultdict as ddic, Counter, deque
import heapq, bisect, itertools
MOD = 10 ** 9 + 7

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

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

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

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

Solution (Python):

import numpy as np
import sys
from collections import deque
from collections import defaultdict
import heapq
import collections
import itertools
import bisect
from scipy.special import comb
import copy
sys.setrecursionlimit(10**6)




def zz():
    return list(map(int, sys.stdin.readline().split()))


def z():
    return int(sys.stdin.readline())


def S():
    return sys.stdin.readline()[:-1]


def C(line):
    return [sys.stdin.readline() for _ in range(line)]


D, T, S = zz()

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

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

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip("\r\n")

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

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

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

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rf = lambda: map(float, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

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

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

Solution (Python):
def main():

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

if __name__ == '__main__':
    print(main())

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    D, T, S = map(int, readline().split())

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


if __name__ == '__main__':
    main()

Solution (Python):
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): 
    return list(map(int,input().split()))
def m(): 
    return map(int,input().split())
def onem(): 
    return int(input())
def s(x): 
    a = []
    if len(x) == 0:
        return []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): 
    return " ".join(map(str,x))
def max2(x): 
    return max(map(max,x))
def In(x,a): 
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def pow_k(x, n):
    ans = 1
    while n:
        if n % 2:
            ans *= x
        x *= x
        n >>= 1
    return ans

"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""
d,t,s = m()

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

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

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

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

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

main()

Solution (Python):
import sys


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


def main():
    d, t, s = _ia()
    return "Yes" if t * s >= d else "No"


if __name__ == "__main__":
    print(main())

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

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

Solution (Python):




import sys









MOD = 10 ** 9 + 7
INF = 10 ** 9
PI = 3.14159265358979323846

def read_str():      return sys.stdin.readline().strip()
def read_int():      return int(sys.stdin.readline().strip())
def read_ints():     return map(int, sys.stdin.readline().strip().split())
def read_ints2(x):   return map(lambda num: int(num) - x, sys.stdin.readline().strip().split())
def read_str_list(): return list(sys.stdin.readline().strip().split())
def read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))
def GCD(a: int, b: int) -> int: return b if a%b==0 else GCD(b, a%b)
def LCM(a: int, b: int) -> int: return (a * b) // GCD(a, b)

def Main():
    d, t, s = read_ints()
    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):
import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter

from functools import lru_cache

sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9 + 7
eps = 10**-7


def inp():
    '''
    一つの整数
    '''
    return int(input())


def inpl():
    '''
    一行に複数の整数
    '''
    return list(map(int, input().split()))


def str_inp():
    '''
    文字列をリストとして読み込む
    '''
    return list(input()[:-1])


d, t, s = inpl()
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')