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.



Sample input:
1000 15 80


Sample output:
Yes

Submission status: Accepted

Solution code:
import sys,os
import math
from fractions import Fraction 
from collections import defaultdict
from random import randint

# sys.stderr=open('err.txt','w')
# sys.stdout=open('output.txt','w')
# sys.stdin=open('input.txt','r')

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(N)) # multi line with multi param
# s = sys.stdin.readline().rstrip()
# N = int(sys.stdin.readline())
# INF = float("inf")
import sys,collections

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 初期入力
import sys
input = sys.stdin.readline  #文字列では使わない
D,T,S = map(int, input().split())
if D > T*S:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:



#for _ in range(int(input())):
#n=int(input())
d,t,s=[int(x) for x in input().split()]  
#s=input()
        
if (d/s)<=t:
   print("Yes")  
else:
   print("No")

Submission status: Accepted

Solution code:
import sys
import bisect
from functools import lru_cache
from collections import defaultdict
inf = float('inf')
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**6)
def input(): return sys.stdin.readline().rstrip()
def read():
  return int(readline())
def reads():
  return map(int, readline().split())

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

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7

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

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, c = map(int,input().split())
d = b * c
if a <= d:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline


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


def readint():
    return int(input())


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


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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

D, T, S = map(int, sys.stdin.readline().split())
print("Yes" if (D - 1) // S + 1 <= T else "No")

Submission status: Accepted

Solution code:
from sys import stdin
readline = stdin.buffer.readline
read = stdin.buffer.read
def r_map(): return map(int, readline().rstrip().split())
# import numpy as np
# from numba import jit
# stdin = open('sample.txt')

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
D, T, S = [int(i) for i in input().split()]
t = D / S
if t > T:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
print(("No", "Yes")[d / s <= t])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

m=d/s

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
dts = input('').split()
d = int(dts[0])
t = int(dts[1])
s = int(dts[2])

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if t*s>=d:
    ans='Yes'
else:
    ans='No'

print(ans)

Submission status: Accepted

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

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

else:
    print('Yes')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
import sys
#from operator import itemgetter
sysread = sys.stdin.buffer.readline
read = sys.stdin.buffer.read
#from heapq import heappop, heappush
#from collections import defaultdict
sys.setrecursionlimit(10**7)
#import math
#from itertools import product, accumulate, combinations, product
#import bisect
#import numpy as np
#from copy import deepcopy
#from collections import deque
#from decimal import Decimal
#from numba import jit

INF = 1 << 50
EPS = 1e-8


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


if __name__ == "__main__":
    run()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
'''بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ'''
#codeforces
gi = lambda : list(map(int,input().split()))
d, t, s = gi()
dur = d // s
if d % s:
	dur += 1
if dur > t:
	print("No")
else:
	print("Yes")

Submission status: Accepted

Solution code:
# = int(input())
# = str(input())
D, T, S = map(int, input().split())
# = list(map(int, input().split()))
# = [int(input()) for i in range(N)]
# = [list(map(int, input().split())) for i in range(N)]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d,t,s = map(float,input().split())

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

Submission status: Accepted

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

ans = T * S

if ans >= D:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
data = input().split(" ")
D = int(data[0])
T = int(data[1])
S = int(data[2])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve():
    D, T, S = [int(i) for i in input().split()]
    print("Yes" if D / S <= T else "No")

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
def main():
    d,t,s = map(int, input().split())
    if d/s <= t:
        print('Yes')
    else:
        print('No')
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [input() for _ in range(n)]

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

temp = d/s

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

if __name__ == '__main__':
    l = list(map(int, input().split()))
    D = int(l[0])
    T = int(l[1])
    S = int(l[2])
    
    if D/S<= T:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin,stdout
from collections import defaultdict
import math
from bisect import bisect
#input=stdin.readline
#def print(x):stdout.write(str(x)+'\n')
d,t,s=map(int,input().split())
if s*t>=d:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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


if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.readline

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
temparr = input()
temparr = temparr.split()
d = int(temparr[0])
t = int(temparr[1])
s = int(temparr[2])

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

Submission status: Accepted

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

a = d/s

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

Submission status: Accepted

Solution code:
a,b,c = map(float,input().split())
if a/c<=b:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
D, T, S = map(lambda x: int(x), input().split(" "))

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

Submission status: Accepted

Solution code:
d,t,s=map(int,input().split())
print(('No','Yes')[d/s<=t])

Submission status: Accepted

Solution code:
from __future__ import division, print_function
import sys
if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip

import os, sys, bisect, copy
from collections import defaultdict, Counter, deque
#from functools import lru_cache   #use @lru_cache(None)
if os.path.exists('in.txt'): sys.stdin=open('in.txt','r')
if os.path.exists('out.txt'): sys.stdout=open('out.txt', 'w')
#
def input(): return sys.stdin.readline()
def mapi(arg=0): return map(int if arg==0 else str,input().split())
#------------------------------------------------------------------


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
int_inputs = lambda: list(map(int, input().split()))

D, T, S = int_inputs()

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

Submission status: Accepted

Solution code:
D,T,S = map(int,input().split())
d = T*S

if(d<D):
  print("No")
  
elif(d>=D):
  print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x,y,z = map(int, input().split())
if x <= y*z:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def examA():
    D,T,S = LI()
    if (D-1)//S<T:
        ans = "Yes"
    else:
        ans = "No"
    print(ans)
    return

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

from decimal import getcontext,Decimal as dec
import sys,bisect,itertools,heapq,math,random
from copy import deepcopy
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def I(): return int(input())
def LI(): return list(map(int,sys.stdin.readline().split()))
def DI(): return dec(input())
def LDI(): return list(map(dec,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = dec("0.000000000001")
alphabet = [chr(ord('a') + i) for i in range(26)]
alphabet_convert = {chr(ord('a') + i): i for i in range(26)}

getcontext().prec = 28

sys.setrecursionlimit(10**7)

if __name__ == '__main__':
    examA()

"""
142
12 9 1445 0 1
asd dfg hj o o
aidn
"""

Submission status: Accepted

Solution code:
n, k,s = map(int, input().split())

if(n/s>k):
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
@author: H_Hoshigi
"""
def main():
    D, T, S = map(int, input().split())

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

minute = D/S

if minute <= T:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

if min > T :
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys

DEBUG = False


def read(t):
    return t(sys.stdin.readline().rstrip())


def read_list(t, sep=" "):
    return [t(s) for s in sys.stdin.readline().rstrip().split(sep)]


def dprint(*args, **kwargs):
    if DEBUG:
        print(*args, **kwargs)
    return


def main():
    d, t, s = read_list(int)
    if d <= t * s:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin

nm = map(int, stdin.readline().split())

d, t, s = nm

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

Submission status: Accepted

Solution code:
# AtCoder Beginner Contest 177
# A - Don't be late

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

Submission status: Accepted

Solution code:
def readInt():
    return list(map(int, input().split()))

d,t,s = readInt()

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

Submission status: Accepted

Solution code:
d, t, s = [int(e) for e in input().split()]

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

Submission status: Accepted

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

time = d/s

if t >= time:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math



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

num = math.ceil(d/s)
print("Yes" if num <= t else "No")

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())
ans = 'Yes'

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
d, t, s = map(int,input().split())
if d/s <= t:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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


main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#ceilevenoddformula
import math
import bisect
import copy
import time
from collections import Counter
from itertools import combinations
#map(int,input().split())
#int(x) for x in input().split()
d,t,s=map(int,input().split())
if d/s<=t:
	print('Yes')
else:
	print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())
print(['No','Yes'][d <= s*t])

Submission status: Accepted

Solution code:
datas = [int(i) for i in input().split(" ")]
D = datas[0]
T = datas[1]
S = datas[2]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if __name__=="__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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


abc177a()

Submission status: Accepted

Solution code:
d,t,s = (int(x) for x in input().split())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

c=d/s

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