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):
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):
    yes()
else:
    no()

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

Solution (Python):
def main():
    d, t, s = (int(i) for i in 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())


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

Solution (Python):
import sys












stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18

def solve():
    
    d,t,s = map(int, stdin.readline().rstrip().split())
    
    
    
    
    
    if s*t >= d:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    solve()

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

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

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

Solution (Python):
import sys

line = sys.stdin.readline().strip().split(" ")

d = float(line[0])
t = float(line[1])
s = float(line[2])

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

Solution (Python):
D,T,S = map(int, open(0).read().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 dontbelate(D,T,S):
    if T <  D//S:
        return 'No'
    elif T > D//S:
        return 'Yes'
    else:
        if D%S == 0:
            return 'Yes'
        else:
            return 'No'


if __name__ == "__main__":
    D,T,S = map(int, input().split())
    print(dontbelate(D,T,S))

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

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

Solution (Python):
import sys

input = sys.stdin.readline



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/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/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 sys, os.path


    
    

sys.setrecursionlimit(10 ** 5)

def i(): return sys.stdin.readline().strip()
def ii(): return int(sys.stdin.readline())
def li(): return list(sys.stdin.readline().strip())
def mii(): return map(int, sys.stdin.readline().split())
def lii(): return list(map(int, sys.stdin.readline().strip().split()))



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

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

L = int(A[1])*int(A[2])
D = int(A[0])


if L >= 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())

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

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

if D >C * 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 = [int(x) for x in input().split()]
time = D/S


if T>=time:
    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())

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

Solution (Python):
a, b, c = [int(i) for i in input().split()]
if b*c >= a:
  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):
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("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())
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 (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):
import sys
sys.setrecursionlimit(1000000000)
import math
from math import gcd
def lcm(a, b): return a * b // gcd(a, b)
from itertools import count, permutations, combinations, chain, product
from functools import lru_cache
from collections import deque, defaultdict
from operator import itemgetter
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok

def get_inv(n, modp):
    return pow(n, modp-2, modp)

def factorials_list(n, modp):    
    fs = [1]
    for i in range(1, n+1):
        fs.append(fs[-1] * i % modp)
    return fs

def invs_list(n, fs, modp):     
    invs = [get_inv(fs[-1], modp)]
    for i in range(n, 1-1, -1):
        invs.append(invs[-1] * i % modp)
    invs.reverse()
    return invs

def comb(n, k, modp):
    num = 1
    for i in range(n, n-k, -1):
        num = num * i % modp
    den = 1
    for i in range(2, k+1):
        den = den * i % modp
    return num * get_inv(den, modp) % modp

def comb_from_list(n, k, modp, fs, invs):
    return fs[n] * invs[n-k] * invs[k] % modp



class UnionFindEx:
    def __init__(self, size):
        
        self.roots = [-1] * size
    def getRootID(self, i):
        r = self.roots[i]
        if r < 0:   
            return i
        else:
            r = self.getRootID(r)
            self.roots[i] = r
            return r
    def getGroupSize(self, i):
        return -self.roots[self.getRootID(i)]
    def connect(self, i, j):
        r1, r2 = self.getRootID(i), self.getRootID(j)
        if r1 == r2:
            return False
        if self.getGroupSize(r1) < self.getGroupSize(r2):
            r1, r2 = r2, r1
        self.roots[r1] += self.roots[r2]    
        self.roots[r2] = r1
        return True

Yes = 'Yes'
No = 'No'

from pprint import pprint

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





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())
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 = map(int, input().split())
if t >= (d / 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):
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())
a = d / t
if a > 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):
x, y, z = input().split()
x = int(x)
y = int(y)
z = int(z)
if x / z <= y:
    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-T*S<=0: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 T-D/S >= 0:
    print("Yes")
else:
    print("No")

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

Solution (Python):
a,b,c = (int(x) for x in input().split())

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

Solution (Python):
text = [int(e) for e in input().split()]

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

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

print("Yes" if 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 = input().split()


D = int(D)
T = int(T)
S = int(S)

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

Solution (Python):

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


D = int(D)
T = int(T)
S = int(S)

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

Solution (Python):

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

Solution (Python):
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):
from sys import stdin,stdout
def INPUT():return list(int(i) for i in stdin.readline().split())
def inp():return stdin.readline()
def out(x):return stdout.write(x)
import math
import random
J=10**19

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

Solution (Python):

import sys,math

def ii(): return int(input())
def mii(): return map(int,input().split())
def lmii(): return list(mii())


def main():
    A,B,C=mii()
    print("Yes" if B*C>=A else "No")
                
                
            
        
            
    
        
if __name__=="__main__":
    main()

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy

if __name__ == "__main__":
    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())
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):



"""


int main() {
    int d, t, s; scanf("%d %d %d", &d, &t, &s);
    if (s * t >= d) {
        puts("Yes");
    } else {
        puts("No");
    }
}
"""

import base64
import subprocess
import zlib


exe_bin = "c%1E7eQZ<L6~E6(hy

open("./kyomu", 'wb').write(zlib.decompress(base64.b85decode(exe_bin)))
subprocess.run(["chmod +x ./kyomu"], shell=True)
subprocess.run(["./kyomu"], shell=True)

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

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

Solution (Python):
str = input().split()
if len(str) != 3:
    print("input values is not three")
else:
    a = int(str[0])
    b = int(str[1])
    c = int(str[2])
    if a <= b * c:
         print("Yes")
    else:
         print("No")

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

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

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

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

input_line = input().split()

distance = int(input_line[0])
remain = int(input_line[1])
speed = int(input_line[2])

time = distance/speed

if time > remain:
  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 S * T >= 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 = input().split()

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

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

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


if a<=T:
    print("Yes")

else:
    print("No")

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

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

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

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

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

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

if d <= s * t:
    result = 'Yes'
else:
    result = 'No'

print(result)

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

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

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

t = D / S

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

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

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

Solution (Python):


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

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

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

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

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

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

Solution (Python):

import base64
import subprocess
import zlib


exe_bin = "c%02yeQaCR6~DIg;WUZkrY

open("./kyomu", 'wb').write(zlib.decompress(base64.b85decode(exe_bin)))
subprocess.run(["chmod +x ./kyomu"], shell=True)
subprocess.run(["./kyomu"], shell=True)

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

Solution (Python):
def main():
    a = list(map(int, input().split()))
    D = a[0]
    T = a[1]
    S = a[2]
    time = D / S
    print("Yes" if time <= T else "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):
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):
d,t,s=map(int,input().split())
if d<=t*s:
  print('Yes')
else:
  print('No')

Solution (Python):
a = input().split()
dist = int(a[0])
time = int(a[1])
speed = int(a[2])
if(speed * time < dist):
	print("No")
else:
	print("Yes")

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

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

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

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

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

Solution (Python):
import sys

try:
    
    
    
    nums = [int(e) for e in input().split()]
except ValueError:
    print('エラー：整数以外を入力しないでください')
    sys.exit(1)

if 1 <= nums[0] <= 10000 and 1 <= nums[1] <= 10000 and 1 <= nums[2] <= 10000:
    take_time = nums[0] / nums[2]
    if take_time <= nums[1]:
        print("Yes")
    else:
        print("No")
else:
    print('エラー：各入力は1～10000までの整数です')

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

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

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

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

Solution (Python):
string_list = input().split(' ')
D = int(string_list[0])
T = int(string_list[1])
S = int(string_list[2])
kyori = T * S
if D<=kyori:
  print('Yes')
else:
  print('No')

Solution (Python):


input_line = input().split(" ")
D = int(input_line[0])
T = int(input_line[1])
S = int(input_line[2])

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

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

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

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

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

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

if S*T>=D:
  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(float, 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):



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

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

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

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

D = int(D)
T = int(T)
S = int(S)


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

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

d=int(d)
t=int(t)
s=int(s)

if d == 0:
    print ('error')
    
elif t == 0:
    print ('error')
        
elif s == 0:
    print ('error')

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

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

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

Solution (Python):
from sys import stdin
def ip(): return [int(i) for i in stdin.readline().split()]
def sp(): return [str(i) for i in stdin.readline().split()]


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

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

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

def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    s = input()
    return(list(s[:len(s) - 1]))
def invr():
    return(map(int,input().split()))

d, t, s = invr()

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

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

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

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

d=b[0]
t=b[1]
s=b[2]
c=int(s)*int(t)
if int(d) <= c:
  print("Yes")
else:
  print("No")

Solution (Python):
num = input()
L = num.split()
D = int(L[0])
T = int(L[1])
S = int(L[2])
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(' '))
result = 'Yes' if D <= T*S else 'No'
print(result)

Solution (Python):
def fun(ls):
    a,b,c = ls
    if b*c>=a:
        print('Yes')
    else:
        print('No')


T = list(map(int, input().split()))
fun(T)

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