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):
'''
自宅用PCでの解答
'''
import math

import itertools
import queue
import bisect
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit


ipt = stdin.readline
setrecursionlimit(10**7)
mod = 10**9+7 
dir = [(-1,0),(0,-1),(1,0),(0,1)]
alp = "abcdefghijklmnopqrstuvwxyz"

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

    return None

if __name__ == '__main__':
    main()

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

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

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):
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 input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().split()


INF = float('inf')


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

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


if __name__ == '__main__':
    main()

Solution (Python):


from collections import defaultdict
con = 10 ** 9 + 7; INF = float("inf")

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


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


if __name__ == '__main__':
	main()

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

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]

def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  D,T,S=LI()
  if T*S<D:
    return 'No'
  return 'Yes'


print(main())

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

Solution (Python):
import sys
import itertools

import time
import math
import heapq
from collections import defaultdict
sys.setrecursionlimit(10 ** 7)
 
INF = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


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

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

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

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

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

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

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

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

in_n = lambda: int(readline())
in_nn = lambda: map(int, readline().split())
in_s = lambda: readline().rstrip().decode('utf-8')
in_nl = lambda: list(map(int, readline().split()))
in_nl2 = lambda H: [in_nl() for _ in range(H)]
in_map = lambda: [s == ord('.') for s in readline() if s != ord('\n')]
in_map2 = lambda H: [in_map() for _ in range(H)]
in_all = lambda: map(int, read().split())


def main():
    D, T, S = in_nn()

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


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
import sys
import math
from collections import deque

sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(input())
NMI = lambda: map(int, input().split())
NLI = lambda: list(NMI())
SI = lambda: input()


def make_grid(h, w, num): return [[int(num)] * w for _ in range(h)]


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


if __name__ == "__main__":
    main()

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))

def do():
    d,t,s=INTM()
    if d<=t*s:
        print('Yes')
    else:
        print('No')
if __name__=='__main__':
    do()

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

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

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

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

Solution (Python):
D, T, S = map(int, input().split())
l = T * S
if l >= 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, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
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 ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

D, T, S = MAP()

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

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

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


if __name__ == "__main__":
    main()

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

Solution (Python):

import os
import sys
from io import BytesIO, IOBase

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


from math import gcd, ceil

def pre(s):
    n = len(s)
    pi = [0] * n
    for i in range(1, n):
        j = pi[i - 1]
        while j and s[i] != s[j]:
            j = pi[j - 1]
        if s[i] == s[j]:
            j += 1
        pi[i] = j
    return pi


def prod(a):
    ans = 1
    for each in a:
        ans = (ans * each)
    return ans

def lcm(a, b): return a * b // gcd(a, b)


def binary(x, length=16):
    y = bin(x)[2:]
    return y if len(y) >= length else "0" * (length - len(y)) + y


for _ in range(int(input()) if not True else 1):
    
    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 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):






import sys
input = sys.stdin.readline

import math

import bisect
import heapq
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache





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






def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]



def DD(arg): return defaultdict(arg)


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n): return kaijo_memo[n]
  if(len(kaijo_memo) == 0): kaijo_memo.append(1)
  while(len(kaijo_memo) <= n): kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n): return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0): gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n): gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if n == r: return 1
  if n < r or r < 0: return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1: arr.append([temp, 1])
  if arr==[]: arr.append([n, 1])
  return arr


def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors


def make_primes(N):
  max = int(math.sqrt(N))
  seachList = [i for i in range(2,N+1)]
  primeNum = []
  while seachList[0] <= max:
    primeNum.append(seachList[0])
    tmp = seachList[0]
    seachList = [i for i in seachList if i % tmp != 0]
  primeNum.extend(seachList)
  return primeNum


def gcd(a, b):
    while b: a, b = b, a % b
    return a


def lcm(a, b):
    return a * b // gcd (a, b)


def count_bit(n):
  count = 0
  while n:
    n &= n-1
    count += 1
  return count


def base_10_to_n(X, n):
  if X//n: return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))

def base_10_to_n_without_0(X, n):
  X -= 1
  if X//n: return base_10_to_n_without_0(X//n, n)+[X%n]
  return [X%n]


def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count





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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


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



if __name__ == '__main__':
    resolve()

Solution (Python):



from fractions import gcd
from itertools import combinations,permutations,accumulate, product 

from collections import deque,defaultdict,Counter
import decimal
import re
import math
import bisect














import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7


from sys import stdin
readline = stdin.readline
def readInts():
  return list(map(int,readline().split()))
def readTuples():
    return tuple(map(int,readline().split()))
def I():
  return int(readline())
d,t,s = readInts()
print('Yes' if d/s <= t else 'No')

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

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

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


if __name__ == '__main__':
    main()

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

Solution (Python):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

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

Solution (Python):
from sys import stdin, setrecursionlimit
from collections import Counter, deque, defaultdict
from math import floor, ceil
from bisect import bisect_left
from itertools import combinations
setrecursionlimit(100000)

INF = int(1e10)
MOD = int(1e9 + 7)

def main():
    from builtins import int, map
    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())

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

Solution (Python):
import sys

sys.setrecursionlimit(500005)
stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().strip()

d, t, s = na()
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):
from collections import defaultdict
from collections import deque
from collections import Counter
import math

def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().split()

d,t,s = readInts()

if d<=t*s:
	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, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce
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 ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

D, T, S = MAP()

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

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

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

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

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

Solution (Python):
import sys, math
from functools import lru_cache
sys.setrecursionlimit(10**9)

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

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

def ii():
    return int(input())

def i2(n):
    tmp = [list(mi()) for i in range(n)]
    return [list(i) for i in zip(*tmp)]

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

if __name__ == '__main__':
    main()

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

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())
print("Yes")if d/s<=t 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
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

d,t,s=map(int,input().split())
YesNo(-(-d//s)<=t)