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

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

ans=None

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

print(ans)

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

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

Solution (Python):
a=list(map(int,input().split()))      
b=a[0]/a[2]
if b<=a[1]:
    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('Yes' if T >= (D / S) else 'No')

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

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

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

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

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

Solution (Python):
def solve(d,t,s):
    if d/s <= t:
        return "Yes"
    return "No"


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

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

ans='No'
if T >= D/S:
    ans='Yes'
    
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(float,input().split())
if (D/S) <= T:
    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:
  print('Yes')
else:
  print('No')

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

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

print('Yes' if d / s <= t else '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):
'''
Created on 2020/08/29

@author: okazakieiichiro
'''

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

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

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

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

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

Solution (Python):
import sys
from sys import stdin
input = 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/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):
a=input().split(" ")
if int(a[0])/int(a[1])<=int(a[2]):
  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 t >= (d/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):



import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    D, T, S = i2nn()
    if D / S <= T:
        print('Yes')
    else:
        print('No')
    return

main()

Solution (Python):
strin = input()
D, T, S = int(strin.split(" ")[0]), int(strin.split(" ")[1]), int(strin.split(" ")[2])
if (D / S) <= T:
    print("Yes")
else:
    print("No")

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

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product, combinations_with_replacement 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    AtoZ = list('abcdefghijklmnopqrsruvwxyz') 
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    class SegTree:
        """
        ref: https://qiita.com/takayg1/items/c811bd07c21923d7ec69
        init(init_val, ide_ele): 配列init_valで初期化 O(N)
        update(k, x): k番目の値をxに更新 O(logN)
        query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
        """
        def __init__(self, init_val, segfunc, ide_ele):
            """
            init_val: 配列の初期値
            segfunc: 区間にしたい操作
            ide_ele: 単位元
            n: 要素数
            num: n以上の最小の2のべき乗
            tree: セグメント木(1-index)
            """
            n = len(init_val)
            self.segfunc = segfunc
            self.ide_ele = ide_ele
            self.num = 1 << (n - 1).bit_length()
            self.tree = [ide_ele] * 2 * self.num
            
            for i in range(n):
                self.tree[self.num + i] = init_val[i]
            
            for i in range(self.num - 1, 0, -1):
                self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])

        def update(self, k, x):
            """
            k番目の値をxに更新
            k: index(0-index)
            x: update value
            """
            k += self.num
            self.tree[k] = x
            while k > 1:
                self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])
                k >>= 1

        def query(self, l, r):
            """
            [l, r)のsegfuncしたものを得る
            l: index(0-index)
            r: index(0-index)
            """
            res = self.ide_ele
            l += self.num
            r += self.num
            while l < r:
                if l & 1:
                    res = self.segfunc(res, self.tree[l])
                    l += 1
                if r & 1:
                    res = self.segfunc(res, self.tree[r - 1])
                l >>= 1
                r >>= 1
            return res

    
    
    
    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    
    def warshall_floyd(number_vertex, XYD, shift_one_for_vertex=False):
        
        
        
        
        
        d = [[float("inf")]*number_vertex for i in range(number_vertex)]
        for x, y, dist in XYD:
            if shift_one_for_vertex:
                x = x - 1
                y = y - 1
            d[x][y] = dist
            d[y][x] = dist
        for i in range(number_vertex):
            d[i][i] = 0 
        for k in range(number_vertex):
            for i in range(number_vertex):
                for j in range(number_vertex):
                    d[i][j] = min(d[i][j],d[i][k] + d[k][j])
        return d


    """ initialize variables and set inputs
    
        
        
            
            
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    
    

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

    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

    
    
    
    
    
    
    
    
    
    
    
    
    
    

    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

    


    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

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

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

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


if __name__ == '__main__':
    main()

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

Solution (Python):

i,j,k = list(map(int, input().split())) 
a=i/k
if a>j:
    print("No")
else:
    print("Yes")

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

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

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

Solution (Python):
inp=list(map(int,input().split()))
d=inp[0]
s=inp[2]
t=inp[1]
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("Yes")
else:
    print("No")

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

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

Solution (Python):
A,B,C = map(int,input().split())
X = A // C
Y = A % C
if Y != 0:
  X += 1
print("Yes" if X <= B else "No")

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

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

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

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(' '))
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):
def solve() :
    d, t, s = map(int, input().split())

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

if __name__ == "__main__":
    solve()

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

Solution (Python):

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



if (DTS[0] / DTS[2] <= DTS[1]):
    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())

TS = T * S

if D <= TS:
    ans = "Yes"
else:
    ans = "No"

print(ans)

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())
import math
a = math.ceil(D / S)

if T >= a:
    print('Yes')
else:
    print('No')

Solution (Python):



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

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

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

c = d / s

if t>=c:
  print('Yes')
elif t<c:
  print('No')

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

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

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

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

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

time = d/s
if t>=time:
    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("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 <= 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 os
import heapq
import sys,threading
import math
import operator
from collections import defaultdict
from io import BytesIO, IOBase

sys.setrecursionlimit(10 ** 5)
threading.stack_size(2**27)


def gcd(a, b):
    if b == 0:
        return a
    else:
        return gcd(b, a % b)


"""def pw(a,b):
    result=1
    while(b>0):
        if(b%2==1): result*=a
        a*=a
        b//=2
    return result"""


def inpt():
    return [int(k) for k in input().split()]


def main():
    d,t,s=inpt()
    t1=d/s
    if(t1<=t):
        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):
import sys,os
import math
from fractions import Fraction 
from collections import defaultdict
from random import randint





def linput():
    return list(minput())

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



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

Solution (Python):








import sys,collections

D,T,S = map(int,sys.stdin.readline().split())

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

Solution (Python):
D,T,S = list(map(int, input().split()))
if T < D/S : 
    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
read = sys.stdin.readline
import time
from heapq import heappush, heappop, heapify
import math
import itertools as it
from collections import deque 


def inp():
    return int(input())
def inpl():
    return list(map(int, input().split()))
start_time = time.perf_counter()


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


end_time = time.perf_counter()
print('time:', end_time-start_time, file=sys.stderr)

Solution (Python):

import sys
input = sys.stdin.readline  
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 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=[int(x) for x in input().split()]  

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