Problem:
 Score : 200 points    Problem Statement Takahashi and Aoki will have a battle using their monsters.  The health and strength of Takahashi's monster are A and B , respectively, and those of Aoki's monster are C and D , respectively.  The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...
Here, an attack decreases the opponent's health by the value equal to the attacker's strength.
The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.  If Takahashi will win, print Yes ; if he will lose, print No .      Constraints  1 \leq A,B,C,D \leq 100  All values in input are integers.         Input Input is given from Standard Input in the following format:  A  B  C  D       Output If Takahashi will win, print Yes ; if he will lose, print No .        Sample Input 1 10 9 10 10      Sample Output 1 No  First, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1 .  Next, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0 .  Takahashi's monster is the first to have 0 or less health, so Takahashi loses.       Sample Input 2 46 4 40 5      Sample Output 2 Yes

Solution (Python):
a, b, c, d = map(int, input().split())
turn = 0

while a > 0 and c > 0:
    if turn == 0:
        c -= b
        turn = 1
    elif turn == 1:
        a -= d
        turn = 0
    else:
        raise RuntimeError('not supported turn')

print('Yes' if a > 0 else 'No')

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

Solution (Python):
A,B,C,D = map(int, input().split())
while A > 0 and C > 0:
  if C > B:
    C -= B
    if A > D:
      A -= D
    else:
      A -= D
      break
  else:
    C -= B
    break
if A > 0:
  print('Yes')
elif C > 0:
  print('No')

Solution (Python):
a,b,c,d=map(int,input().split())

index=0
for i in range(1000):
	if index==0:
		c=c-b
		if c<=0:
			print("Yes")
			break
		else:
			index=1
	else:
		a=a-d
		if a<=0:
			print("No")
			break
		else:
			index=0

Solution (Python):
A, B, C, D = list(map(int, input().split()))

while True:
    A = A - D
    C = C - B
    if C <= 0:
        print("Yes")
        break
    elif A <= 0:
        print("No")
        break

Solution (Python):
a,b,c,d=map(int, input().split())
import math
if math.ceil(c/b)<=math.ceil(a/d): print('Yes')
else: print('No')

Solution (Python):
import math
a,b,c,d = list(map(int,input().split()))
taka = math.ceil(c/b)
aoki = math.ceil(a/d)
if taka <= aoki:
	print("Yes")
else:
	print("No")

Solution (Python):
a,b,c,d = map(int,input().split())
aoki = 0
tk = 0
while a>0:
    a = a - d
    aoki += 1
while c>0:
    c = c - b
    tk += 1
if aoki >= tk:
    print("Yes")
else:
    print("No")

Solution (Python):
A,B,C,D=map(int,input().split())
flag=0

while A>0 and C>0:
    C=C-B
    A=A-D
    
    if C<=0:
        print("Yes")
        break
        
    elif A<=0:
        print("No")
        break

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

sFlag=True
HPC=C
HPA=A
while(sFlag):
  HPC=HPC-B
  if(HPC<=0):
    print('Yes')
    sFlag=False
    break
  HPA=HPA-D
  if(HPA<=0):
    print('No')
    sFlag=False
    break

Solution (Python):
a,b,c,d=map(int,input().split())

counttaka=(a-1)//d
countao=(c-1)//b

if counttaka>=countao:
  print("Yes")
else:
  print("No")

Solution (Python):
def resolve():
    a, b,c,d = map(int, input().split())
    while a > 0 and c > 0:
        c -= b
        if c <= 0:
            print("Yes")
            exit()
        a -= d
        if a<= 0:
            print("No")
            exit()
resolve()

Solution (Python):
a, b, c, d = map(int, input().split())
ans = ''
while True:
    c -= b
    if c <= 0:
        ans = 'Yes'
        break
    a -= d
    if a <= 0:
        ans = 'No'
        break
print(ans)

Solution (Python):
takaMonHP, takaMonAP, aokiMonHP, aokiMonAP = map(int, input().split())

while True:
    aokiMonHP = aokiMonHP - takaMonAP
    if aokiMonHP <= 0:
        print("Yes")
        break
    takaMonHP = takaMonHP - aokiMonAP
    if takaMonHP <= 0:
        print("No")
        break

Solution (Python):
Thp,Tatk,Ahp,Aatk = map(int,input().split())
 
import math
 
Ta = math.ceil(Thp/Aatk)
Ao = math.ceil(Ahp/Tatk)

if Ta >= Ao:
    print("Yes")
else:
    print("No")

Solution (Python):
import math
A, B, C, D = map(int, input().split())
if math.ceil(A/D)>=math.ceil(C/B):
    print("Yes")
else:
    print("No")

Solution (Python):
a, b,c,d = map(int, input().split())
taka=-(-c//b) 
ao=-(-a//d) 

if taka<=ao:
    print('Yes')
else:
    print('No')

Solution (Python):
from itertools import count

a, b, c, d = map(int, input().split())

for i in count():
    if i % 2 == 0:
        c -= b
        if c <= 0:
            print('Yes')
            break
    else:
        a -= d
        if a <= 0:
            print('No')
            break

Solution (Python):
import math
A,B,C,D = map(int,input().split())

while True:
    C -= B
    if C <= 0:
        print('Yes')
        break
    A -= D
    if A <= 0:
        print('No')
        break

Solution (Python):
a,b,c,d = map(int, input().split())
while a > 0 and c > 0:
    c -= b
    if c <= 0:
        print("Yes")
        break
    a -= d
    if a <= 0:
        print("No")
        break

Solution (Python):
th, ta, ah, aa = map(int,input().split())
taeru_takahashi = 0
taeru_aoki = 0
if th%aa==0:
    taeru_takahashi = th//aa
else:
    taeru_takahashi = (th//aa)+1
if ah%ta ==0:
    taeru_aoki = ah//ta
else:
    taeru_aoki = (ah//ta)+1
if taeru_takahashi >= taeru_aoki:
    print("Yes")
else:
    print("No")

Solution (Python):
A,B,C,D=map(int,input().split())
a,b=0,0
if C%B!=0:
    a=1
if A%D!=0:
    b=1
if C//B+a>A//D+b:
    print("No")
else:
    print("Yes")

Solution (Python):

a, b, c, d = map(int, input().split())
T = [a, b]
A = [c, d]
flagT = 0
flagA = 0
while 1:
    A[0] -= T[1]
    if A[0] <= 0:
        flagA = 1
        break
    T[0] -= A[1]
    if T[0] <= 0:
        flagT = 1
        break
if flagT == 1:
  print("No")
if flagA == 1:
  print("Yes")

Solution (Python):
LI = lambda: list(map(int,input().split()))
MI = lambda: map(int,input().split())
yes = lambda: print("Yes")
no = lambda: print("No")
I = lambda: list(input())
J = lambda x: "".join(x)
II = lambda: int(input())
SI = lambda: input()

a,b,c,d = MI()
while(a > 0 and c >0):
	c-=b
	if c<=0:
		yes()
		break
	a-=d
	if a<=0:
		no()
		break

Solution (Python):
import sys 
import math
try:
    sys.stdin = open('input.txt', 'r') 
    sys.stdout = open('output.txt', 'w')
except:
    pass

input = sys.stdin.readline
ht,st,ha,sa = map(int,input().split())
t = math.ceil(ht/sa)
a = math.ceil(ha/st)
if t>=a:
	print("Yes")
else:
	print("No")

Solution (Python):
import math
a,b,c,d = [int(i) for i in input().split()]
if math.ceil(c/b) <= math.ceil(a/d):
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c, d = map(int, input().split())

while(1):
    c = c - b
    if c <= 0:
        print("Yes")
        break

    a = a - d
    if a <= 0:
        print("No")
        break

Solution (Python):






"""Module docstring
"""

import functools
import heapq
import itertools
import logging
import math
import random
import string
import sys
from argparse import ArgumentParser
from collections import defaultdict, deque
from copy import deepcopy
from typing import Dict, List, Optional, Set, Tuple


def solve(h1: int, s1: int, h2: int, s2: int) -> bool:
    while h1 > 0 and h2 > 0:
        h1 -= s2
        h2 -= s1
        
        
    return h2 <= 0


def do_job():
    "Do the work"
    LOG.debug("Start working")
    
    
    A, B, C, D = list(map(int, input().split()))
    
    
    
    result = solve(A, B, C, D)
    print("Yes" if result else "No")


def print_output(testcase: int, result) -> None:
    "Formats and print result"
    if result is None:
        result = "IMPOSSIBLE"
    print("Case 
    
    


def configure_log() -> None:
    "Configure the log output"
    log_formatter = logging.Formatter("%(lineno)d - " "%(message)s")
    handler = logging.StreamHandler(sys.stdout)
    handler.setFormatter(log_formatter)
    LOG.addHandler(handler)


LOG = None

if not LOG:
    LOG = logging.getLogger("template")
    configure_log()


def main(argv=None):
    "Program wrapper."
    if argv is None:
        argv = sys.argv[1:]
    parser = ArgumentParser()
    parser.add_argument(
        "-v",
        "--verbose",
        dest="verbose",
        action="store_true",
        default=False,
        help="run as verbose mode",
    )
    args = parser.parse_args(argv)
    if args.verbose:
        LOG.setLevel(logging.DEBUG)
    do_job()
    return 0


if __name__ == "__main__":
    import doctest

    doctest.testmod()
    sys.exit(main())


class memoized:
    """Decorator that caches a function's return value each time it is called.
    If called later with the same arguments, the cached value is returned, and
    not re-evaluated.
    """

    def __init__(self, func):
        self.func = func
        self.cache = {}

    def __call__(self, *args):
        try:
            return self.cache[args]
        except KeyError:
            value = self.func(*args)
            self.cache[args] = value
            return value
        except TypeError:
            
            
            return self.func(*args)

    def __repr__(self):
        """Return the function's docstring."""
        return self.func.__doc__

    def __get__(self, obj, objtype):
        """Support instance methods."""
        return functools.partial(self.__call__, obj)

Solution (Python):
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
d = int(x[3])

while True:
    c -= b
    if c <= 0:
        print('Yes')
        break
    a -= d
    if a <= 0:
        print('No')
        break

Solution (Python):
import math
a, b, c, d = map(int, input().split())
e = math.ceil(c/b)
f = math.ceil(a/d)
if e<=f:
  print("Yes")
else:
  print("No")

Solution (Python):

from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect


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


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


def LS(): return [list(x) for x in sys.stdin.readline().split()]


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


def LIR(n):
    return [LI() for i in range(n)]


def SR(n):
    return [S() for i in range(n)]


def LSR(n):
    return [LS() for i in range(n)]


sys.setrecursionlimit(1000000)
mod = 1000000007


def solve():
    a, b, c, d = LI()
    while a > 0 and c > 0:
        c -= b
        if c <= 0:
            print('Yes')
            break
        a -= d
        if a <= 0:
            print('No')
    return



if __name__ == "__main__":
    solve()

Solution (Python):
a,b,c,d=map(int,input().split())
for i in range(1000):
    if i%2 == 0:
        c = c-b
        if c <= 0:
            print('Yes')
            break
    else:
        a = a-d
        if a <= 0:
            print('No')
            break

Solution (Python):
A, B, C, D = (int(i) for i in input().split())  

takalife = A
takaa = B
aotlife = C
aoa = D

i = 0

while A > 0 and C > 0 :
    if i % 2 == 0: 
        C = C - B
    else:
        A = A - D
    i += 1
if C <= 0:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c,d=map(int,input().split())
while a>0 and c>0:
    c=c-b
    if c<=0:
        print("Yes")
        break
    a=a-d
    if a<=0:
        print("No")
        break

Solution (Python):
a, b, c, d= list(map(int, input().split()))

while 1 :
  c = c-b
  if c <= 0:
    print('Yes')
    break
  a = a-d
  if a <= 0:
    print('No')
    break

Solution (Python):

a, b, c, d = (int(x) for x in input().split())

while 0 <= c or 0 <= c :
    
    c = c - b
    if c <= 0 : 
        ans = 'Yes'
        break

    a = a - d
    if a <= 0 :
        ans = 'No'
        break


print(ans)

Solution (Python):
import math
a, b, c, d = map(int, input().split())
if math.ceil(c/b) > math.ceil(a/d):
  print("No")
else:
  print("Yes")

Solution (Python):
T_HP,T_ATK,A_HP,A_ATK = map(int, input().strip().split())

while True:
  A_HP -= T_ATK
  if A_HP <= 0:
    print('Yes')
    break
  T_HP -= A_ATK
  if T_HP <= 0:
    print('No')
    break

Solution (Python):
a,b,c,d=map(int,input().split())
while c>0 and a>0:
	c=c-b
	if c<=0:
		print('Yes')
		break
	a=a-d
	if a<=0:
		print('No')
		break

Solution (Python):
from sys import stdin
def main():
	inp=stdin.readline
	a,b,c,d=map(int, inp().split())
	f=False
	while a>0 and c>0:
		if f:
			a-=d
		else:
			c-=b
		f=not(f)
	if a>0:
		print("Yes")
	else:
		print("No")

main()

Solution (Python):
A,B,C,D = map(int,input().split())
i = 0
while True:
    if i % 2 == 0:
        C -= B
        if C <= 0:
            break
    else:
        A -= D
        if A <= 0:
            break
    i += 1
if i % 2 == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
a, b, c, d = map(int, input().split())
while a>0 and c>0:
  c -= b
  if c > 0:
  	a -= d
if a>0 and c<=0:
  print('Yes')
else:
  print('No')

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

c = 0

while A > 0 and C > 0:
    if c%2 == 0:
        C -= B
    else:
        A -= D

    c += 1

if A < C:
    print("No")
else:
    print("Yes")

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

while(A>0 and C>0):
    C -= B
    A -= D

if(C<=0):
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c,d=map(int,input().split())
while True:
 a=a-d
 c=c-b
 if a<=0 and c>0:
  print("No")
  exit()
 elif a>0 and c<=0:
  print("Yes")
  exit()
 elif a<=0 and c<=0:
  print("Yes")
  exit()

Solution (Python):
th, ts, ah, a2 = map(int, input().split())
while th > 0 or ah > 0:
    ah -= ts
    if ah <=0:
        print("Yes")
        exit()
    th -= a2
    if th <= 0:
        print("No")
        exit()

Solution (Python):
a,b,c,d=map(int,input().split())
al=a
cl=c
for i in range(1000):
  cl-=b
  if cl<=0:
    print('Yes')
    break
  al-=d
  if al<=0:
    print('No')
    break

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

attack_t = C//B
kalan_t = C%B
if kalan_t != 0:
    attack_t += 1

attack_a = A//D
kalan_a = A%D
if kalan_a != 0:
    attack_a += 1

if attack_t <= attack_a:
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c, d = map(int, input().split())
print('YNeos'[-(-a//d) < -(-c//b)::2])

Solution (Python):
a,b,c,d = map(int,input().split())
for i in range(1000):
    
    c = c-b
    if c>0:
        pass
    else:
        print('Yes')
        break
    a = a-d
    if a>0:
        pass
    else:
        print('No')
        break

Solution (Python):
def main():
    a, b, c, d = [int(x) for x in input().split()]
    while 1:
        c -= b
        if not (a > 0 and c > 0):
            break

        a -= d
        if not (a > 0 and c > 0):
            break

    if a > 0:
        return 'Yes'
    else:
        return 'No'


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

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

if C % B == 0:
  n_t = C//B
else:
  n_t = C//B + 1
  
if A % D == 0:
  n_a = A//D
else:
  n_a = A//D + 1

if n_a >= n_t:
  print('Yes')
else:
  print('No')

Solution (Python):
def solve():
    items=list(input().split())
    T_health=int(items[0])
    T_strength=int(items[1])
    A_health=int(items[2])
    A_strength=int(items[3])
    while(T_health>0 and A_health>0):
        A_health-=T_strength
        if(A_health>0):
            T_health-=A_strength
    if(T_health<=0):
        print("No")
    if(A_health<=0):
        print("Yes")
    return
solve()

Solution (Python):
a,b,c,d =map(int,input().split())

while c>0 and a>0:
    c =c-b
    a =a-d
    if c<=0 :
        print('Yes')
        exit()
    elif a<=0 :
        print('No')
        exit()

Solution (Python):
TH,TB,AH,AB = map(int, input().split())

while True:
  AH=AH-TB
  if AH<=0:
    print("Yes")
    break
  TH=TH-AB
  if TH<=0:
    print("No")
    break

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

if -(-C//B) > -(-A//D):
    print("No")
else:
    print("Yes")

Solution (Python):
a,b,c,d = map(int,input().split())
for i in range(1000):
    if c > 0:
        c -= b
    else:
        print("Yes")
        break
    if a > 0:
        a -= d
    else:
        print("No")
        break

Solution (Python):
a,b,c,d=map(int,input().split())
turn=0
while a>0 and c>0:
    if turn%2==0:
        c-=b
    else:
        a-=d
    turn+=1
if a<=0:
    print("No")
else:
    print("Yes")

Solution (Python):
A,B,C,D=map(int,input().split())
flag=0
while A>0 and C>0:
  if flag==0:
    C-=B
    flag=1
  else:
    A-=D
    flag=0
if C<=0:
  print("Yes")
else:
  print("No")

Solution (Python):
t_hp, t_ap, a_hp, a_ap=(int(x) for x in input().split())
while(t_hp > 0):
  a_hp = a_hp - t_ap
  if a_hp < 1:
    print("Yes")
    break
  t_hp = t_hp - a_ap
if t_hp < 1:
  print("No")

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

while (A>0 and C > 0):
    C = C - B
    if C <= 0:
        break
    A = A - D

print("Yes" if C<=0 else "No")

Solution (Python):
a,b,c,d=map(int,input().split())

for i in range(200):
    if i%2==0:
        c-=b
        if c<=0:
            print('Yes')
            break
    else:
        a-=d
        if a<=0:
            print('No')
            break

Solution (Python):
a,b,c,d = map(int,input().split())

taka = (int(c/b)) + (1 if c%b != 0 else 0)
aoki = (int(a/d)) + (1 if a%d != 0 else 0)

if taka <= aoki:
  print('Yes')
else:
  print('No')

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

ans = ''
for i in range(200):
    if i%2 == 0:
        C -= B
    else:
        A -= D
    if A <= 0:
        ans = 'No'
        break
    elif C <= 0:
        ans = 'Yes'
        break

print(ans)

Solution (Python):
a, b, c, d = map(int, input().split())

while True:
    c -= b
    if c<= 0:
        break
    a -= d
    if a<= 0:
        break
if c<= 0:
    print('Yes')
elif a<=0:
    print('No')

Solution (Python):
import sys

input = sys.stdin.readline


def solve():
    t_stamina, t_attack, a_stamina, a_attack = map(int, input().split())
    t_num_attack_to_be_beaten = - (-t_stamina // a_attack)
    a_num_attack_to_be_beaten = - (-a_stamina // t_attack)

    if t_num_attack_to_be_beaten >= a_num_attack_to_be_beaten:
        return 'Yes'
    else:
        return 'No'


if __name__ == '__main__':
    answer = solve()
    print(answer)

Solution (Python):
A,B,C,D = map(int,input().split())
while True:
  C = C - B
  if C <= 0:
    print("Yes")
    break
  A = A - D
  if A <= 0:
    print("No")
    break

Solution (Python):
A,B,C,D = map(int,input().split())
t = C//B
a = A//D
if C%B > 0:
    t += 1
if A%D > 0:
    a += 1

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

Solution (Python):
a,b,c,d = map(int, input().split())

while True:
    c -= b
    if c <= 0:
        flag = True
        break
    a -= d
    if a <= 0:
        flag = False
        break
if flag:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c,d = map(int, input().split())
print(["No","Yes"][a//d + (a%d > 0) >= c//b + (c%b > 0)])

Solution (Python):
A, B, C, D = map(int, input().split())
counter = 1
while A > 0 and C > 0:
    if counter % 2 == 1:
        '''T 攻击'''
        C -= B
    elif counter % 2 == 0:
        A -= D
    counter += 1
if A <= 0:
    print('No')
else:
    print('Yes')

Solution (Python):
a, b, c, d = map(int, input().split())
i = 0
while a > 0 and c > 0:
    if i & 1:
        a -= d
    else:
        c -= b
    i += 1
if a <= 0:
    print('No')
else:
    print('Yes')

Solution (Python):

import math

a,b,c,d = map(int,input().split())

at1 = math.ceil(c / b)
at2 = math.ceil(a / d)

if at1 <= at2:
    print("Yes")
else:
    print("No")

Solution (Python):
a, b, c, d = map(int, input().split())
e = -(-c//b)
f = -(-a//d)
if e > f:
    print("No")
elif f<e:
    print("Yes")
else:
    print("Yes")

Solution (Python):
import math

a, b, c, d = map(int, input().split())

taka = math.ceil(c / b)
aoki = math.ceil(a / d)

ans = "No"
if taka <= aoki:
    ans = "Yes"
print(ans)

Solution (Python):
a, b, c, d = map(int, input().split())
x = -(-a // d)
y = -(-c // b)
if x == y:
    print('Yes')
if x < y:
    print('No')
if x > y:
    print('Yes')

Solution (Python):
a, b, c, d = map(int, input().split())

t = a // d
if a % d:
    t = a // d + 1

s = c // b 
if c % b:
    s = c // b + 1

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

Solution (Python):
A,B,C,D = map(int,input().split())
while True:
    C -= B
    if C <= 0:
        print("Yes")
        break
    A -= D
    if A <= 0:
        print("No")
        break

Solution (Python):
a, b, c, d = map(int, input().split())

T_hp = a
A_hp = c
for _ in range(100):
    A_hp -= b
    if A_hp <= 0:
        print('Yes')
        exit()
    T_hp -= d
    if T_hp <= 0:
        print('No')
        exit()

Solution (Python):
a, b, c, d = map(int, input().split())
while(a > 0 and c > 0):
  c -= b
  if(c > 0):
    a -= d
print("Yes" if (a > 0) else "No")

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

while A > 0 and C > 0:
  C = C - B
  if C <= 0:
    break
  A = A - D
  
if A <= 0:
  print("No")
if C <= 0:
  print("Yes")

Solution (Python):
a, b, c, d = map(int, input().split())
done = "No"
while True:
    c -= b
    if c <= 0:
        done = "Yes"
        break
    a -= d
    if a <= 0:
        break
print(done)

Solution (Python):
a, b, c, d = map(int, input().split())

mod_a, q_a = divmod(a, d)
if (q_a == 0):
  aoki = mod_a
else:
  aoki = mod_a + 1

mod_t, q_t = divmod(c, b)
if (q_t == 0):
  takahashi = mod_t
else:
  takahashi = mod_t + 1

if (takahashi <= aoki):
  print('Yes')
else:
  print('No')

Solution (Python):
A,B,C,D=list(map(int, input().split()))
if (A-1)//D>=(C-1)//B:
  print('Yes')
else:
  print('No')

Solution (Python):


import math


A,B,C,D = list(map(int, input().split()))


takahashi_attack_count = math.ceil(C / B)
aoki_attack_count = math.ceil(A / D)
result = ""
if takahashi_attack_count <= aoki_attack_count:
    result = "Yes"
else:
    result = "No"


print(result)

Solution (Python):
a, b, c, d = map(int, input().split())

if c%b != 0:
    taka = c//b + 1
else:
    taka = c//b

if a%d != 0:
    ao = a//d + 1
else:
    ao = a//d

if taka > ao:
    print('No')
else:
    print('Yes')

Solution (Python):
import math
abcd = input().split()

a = float(abcd[0])
b = float(abcd[1])
c = float(abcd[2])
d = float(abcd[3])

t = math.ceil(a/d)
a = math.ceil(c/b)

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

Solution (Python):
a,b,c,d=map(int,input().split())

acount=0
ccount=0

while 0<a:
    acount+=1
    a-=d


while 0<c:
    ccount+=1
    c-=b



if acount<ccount:
    print("No")
else:
    print("Yes")

Solution (Python):
def func():
    return



a, b, c, d = map(int, input().split())



while True:
    c -= b
    if c <= 0:
        ans = "Yes"
        break

    a -= d
    if a <= 0:
        ans = "No"
        break

print(ans)

Solution (Python):
a, b, c, d = map(int, input().split())

while a > 0 and c > 0:
    c -= b
    if c <= 0:
        break
    a -= d
    if d <= 0:
        break

if c <= 0:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C, D = map(int, input().split(' '))

i = 1

while (A > 0 and C >0):
    if i% 2 ==1:
        C = C - B
    else:
        A = A- D
    i += 1

if C <= 0:
    print('Yes')
else:
    print('No')

Solution (Python):
A,B,C,D=map(int,input().split())
while A>0 and C>0:
  A-=D
  C-=B
if C<=0:
  print('Yes')
else:
  print('No')

Solution (Python):
inp = input()
inlist = inp.split()

tD = int(inlist[0])
tA = int(inlist[1])
aD = int(inlist[2])
aA = int(inlist[3])

tlife = tD
alife = aD

while(True):
  alife -= tA
  if( alife <= 0):
    print("Yes")
    break
  
  tlife -= aA
  if( tlife <= 0):
    print("No")
    break

Solution (Python):
import math
a,b,c,d=list(map(int,input().split()))
tak=math.ceil(a/d)
aok=math.ceil(c/b)

if tak>=aok:
    print('Yes')
else:
    print('No')

Solution (Python):
h1, s1, h2, s2 = map(int, input().split())
while(True):
  h2 -= s1
  if(h2 <= 0):	
    print('Yes')
    break
  h1 -= s2
  if(h1 <= 0):
    print('No')
    break

Solution (Python):

"""
@author: H_Hoshigi
"""
def main():
    import math
    A, B, C, D = map(int, input().split())
    answer = ""
    atack_no_takahashi = math.ceil(C/B)
    atack_no_aoki = math.ceil(A/D)
    if atack_no_takahashi <= atack_no_aoki:
        answer = "Yes"
    else:
        answer = "No"
    print(answer)

if __name__ == "__main__":
    main()

Solution (Python):
N = list(map(int, input().split()))

while N[0]>=0:
    N[2]= N[2] - N[1]
    if N[2]<=0:
        print("Yes")
        break
    N[0] = N[0]-N[3]
    if N[0] <=0:
        print("No")
        break

Solution (Python):
A, B, C, D = map(int, input().split())
An=A
Cn=C
Ai=0
Ci=0
while An>0:
    An=An-D
    Ai+=1
while Cn>0:
    Cn=Cn-B
    Ci+=1
print("Yes" if Ai>=Ci else "No")

Solution (Python):


a, b, c, d = list(map(int, input().split()))

while True:
    c -= b
    if c<=0:
        print('Yes')
        exit()
    a -= d
    if a<=0:
        print('No')
        exit()

Solution (Python):
def abc(A, B, C, D):
    
    ans = 'No'
    
    
    while True:
        C -= B
        if C <= 0:
            ans = 'Yes'
            break
        A -= D
        if A <= 0:
            break
    
    
    return(ans)



if __name__ == "__main__":
    
    
    A, B, C, D = map(int, input().split())
    
    
    f = abc(A, B, C, D)
    
    
    print(f)

Solution (Python):
A,B,C,D=map(int,input().split())
while C>=0:
    C-=B
    if C<=0:
        print('Yes')
        break
    A-=D
    if A<=0:
        print('No')
        break

Solution (Python):
import math

A, B, C, D = list(map(int, input().split()))

number_of_turns_takahsi = math.ceil(C / B)
number_of_turns_aoki = math.ceil(A / D)


answer = 'Yes' if number_of_turns_takahsi <= number_of_turns_aoki else 'No'

print(answer)

Solution (Python):
inputs = str(input())
A = int(inputs.split()[0])
B = int(inputs.split()[1])
C = int(inputs.split()[2])
D = int(inputs.split()[3])


for i in range(100):
    C = C - B
    if C <= 0:
        text = "Yes"
        break
    A = A - D
    if A <= 0:
        text = "No"
        break

print(text)

Solution (Python):
a,b,c,d=map(int,input().split())
while True:
    c-=b
    if c<=0:print('Yes');break
    a-=d
    if a<=0:print('No');break

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

while True:
  C -= B
  if C <= 0 :
    print("Yes")
    break
  A -= D
  if A <= 0 :
    print("No")
    break

Solution (Python):
A, B, C, D = [int(n) for n in input().split()]
while True:
    C -= B
    if C<=0:
        break
    A -= D
    if A<=0:
        break
print('Yes' if A>C else 'No')

Solution (Python):
a,b,c,d = map(int, input().split())

while a >=0 and c>=0:
    c-=b
    if c<=0:
        print('Yes')
        break
    a-=d
    if a<=0:
        print('No')
        break

Solution (Python):
a,b,c,d = map(int,input().split())
while True:
    c -= b
    if c <= 0:
        print("Yes")
        break
    a -= d
    if a <= 0:
        print("No")
        break

Solution (Python):
a, b, c, d = map(int, input().split())

turn = 0
while a > 0 and c > 0:
    if turn % 2 == 0:
        c -= b
    else:
        a -= d
    turn += 1

print("Yes" if a > c else "No")

Solution (Python):
a, b, c, d = map(int, input().split())

while True:
    c = c -b
    if c <= 0:
        print('Yes')
        break
    a = a - d
    if a <= 0:
        print('No')
        break

Solution (Python):
import math

a, b, c, d = map(int, input().split())
taka = math.ceil(c/b)
ao = math.ceil(a/d)
if taka > ao:
    print("No")
else:
    print("Yes")

Solution (Python):
A,B,C,D=map(int,input().split())
for x in range(102):
    C=C-B
    A=A-D
    if C<=0:
        print('Yes')
        break
    elif A<=0:
        print('No')
        break

Solution (Python):
from math import ceil
f=0
    
    
    
    
a,b,c,d=map(int,input().split())
x=ceil(c/b)
y=ceil(a/d)
if(x<=y):
    f=1


print("Yes" if f==1 else "No")

Solution (Python):
A,B,C,D= map(int,input().split())
wflag = False

for count in range(0,1000):
    C = C-B
    if C <=0:
        wflag = True;
        break;
    A = A-D
    if A <=0:
        break;

if wflag == True:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c,d = map(int,input().split())
while c>0:
    c = c-b
    a = a-d
    if c>0 and a <= 0:
        print('No')
        break
if c<=0:
    print('Yes')

Solution (Python):
A,B,C,D=map(int,input().split())
E=0
F=0
if A%D==0:
  E=A//D
else:
  E=A//D+1
if C%B==0:
  F=C//B
else:
  F=C//B+1
if E>=F:
  print("Yes")
else:
  print("No")

Solution (Python):
a,b,c,d = map(int,input().split())
while True:
    a -=d
    c -=b
    if c <= 0:
        print('Yes')
        break
    elif a <= 0:
        print('No')
        break

Solution (Python):
def main():
  a, b, c, d = tuple([int(e) for e in input().split()])

  s = [b, d]
  h = [c, a]
  idx = 0
  while h[0] > 0 and h[1] > 0:
    h[idx] -= s[idx]
    idx ^= 1
  
  if h[1] > 0:
    print('Yes')
  else:
    print('No')
  return 0

main()

Solution (Python):
A, B, C, D = input().split()

A = int(A)
B = int(B)
C = int(C)
D = int(D)

while True:
  C -= B
  if(C <= 0):
    print('Yes')
    break
  A -= D
  if(A <= 0):
    print('No')
    break

Solution (Python):
hp, atk, ehp, eatk = map(int, input().strip().split())

while True:
    ehp -= atk
    if ehp <= 0:
        print('Yes')
        break
    hp -= eatk
    if hp <= 0:
        print('No')
        break

Solution (Python):
import sys
a,b,c,d=map(int,input().split())

for i in range(1000):
    c -= b
    if c <= 0:
        print("Yes")
        sys.exit()
    a -= d
    if a <=0:
        print("No")
        sys.exit()

Solution (Python):
from math import ceil

A, B, C, D = map(int, input().split())

print('Yes' if ceil(C / B) <= ceil(A / D) else 'No')

Solution (Python):
a,b,c,d=map(int,input().split())
while a>0 or c>0:
    c-=b
    if c<=0:
        print('Yes')
        exit()
    a-=d
    if a<=0:
        print('No')
        exit()

Solution (Python):
A,B,C,D=input().split(' ')
A=int(A)
B=int(B)
C=int(C)
D=int(D)
while True:
  C-=B
  if C<=0:
    print('Yes')
    break
  A-=D
  if A<=0:
    print('No')
    break

Solution (Python):
a = list(map(int,input().split()))

while True:
    a[2] -= a[1]
    if a[2]<= 0:
        print("Yes")
        break
    a[0] -= a[3]
    if a[0]<=0:
        print("No")
        break

Solution (Python):
a, b, c, d = map(int, input().split())
while a > 0 and c > 0:
  c -= b
  a -= d
if c <= 0:
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c,d = map(int, input().split())
takahashi = a // d 
aoki = c // b

if a % d != 0:
    takahashi += 1
if c % b != 0:
    aoki += 1
    
if takahashi < aoki:
    print("No")
else:
    print("Yes")

Solution (Python):
import sys
a, b, c, d = map(int, input().split())

for i in range(1, 10000):
    c1=c-b*i
    if (c1 <= 0):
        print ('Yes')
        sys.exit()
    a1=a-d*i
    if (a1 <= 0):
        print ('No')
        sys.exit()

Solution (Python):
import math
a, b, c, d =map(int, input().split())
ans1 = math.ceil(a / d)

ans2 = math.ceil(c / b)

if ans2 <= ans1:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c,d=map(int,input().split())

x=0
if c%b!=0:
    x=c//b+1
else:
    x=c//b

y=0
if a%d!=0:
    y=a//d+1
else:
    y=a//d

if x<=y:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c,d=map(int,input().split())
while a>0 and c>0:
    c-=b
    if c<=0:
        print('Yes')
        break
    a-=d
    if a<=0:
        print('No')
        break