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(' '))
while A>0 and C>0:
  
  C -= B
  if C <= 0: break
  
  A -= D

print('Yes' if A>C else 'No')

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 turn%2 == 1:
    print('Yes')
else:
    print('No')

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

Solution (Python):
import sys

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

while True:
    c = c - b
    if c <= 0:
        print("Yes")
        sys.exit()
    else:
        a = a - d
    if a <= 0:
        print("No")
        sys.exit()

Solution (Python):
t_hp, t_pwr, a_hp, a_pwr = map(int, input().split())

while True:
    a_hp -= t_pwr
    t_hp -= a_pwr

    if a_hp <= 0:
        print("Yes")
        break
    elif t_hp <= 0:
        print("No")
        break

Solution (Python):
a1, a2, b1, b2 = map(int, input().split())

if -(-b1//a2) <= -(-a1//b2):
    print("Yes")
else:
    print("No")

Solution (Python):

input_line = input().split()
A = int(input_line[0])
B = int(input_line[1])
C = int(input_line[2])
D = int(input_line[3])
while (1):
    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):
    A = A - D
    C = C - B

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

Solution (Python):
from math import ceil

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

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

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):
t_hp, t_atk, a_hp, a_atk = map(int, input().split())
frag = 0
winner = 0 
while(frag == 0):
    a_hp = a_hp - t_atk
    if(a_hp <= 0):
        frag = 1
        winner = 1
        break
    t_hp = t_hp - a_atk
    if(t_hp <= 0):
        frag = 1
        winner = 2
        break

if(winner == 1):
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c, d = map(int, input().split())
count_x = 0
count_y = 0
while a > 0:
    a -= d
    count_y += 1
while c > 0:
    c -= b
    count_x += 1

if count_x <= count_y:
    print("Yes")
else:
    print("No")

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







if (c+b-1)//b <= (a+d-1)//d:
    print("Yes")
else:
    print("No")

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

for _ in range(100):
    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())  



t_win = 'No'
while 1:
    ah -= ta
    if ah <= 0:
        t_win = 'Yes'
        break
    th -= aa
    if th <= 0:
        break
print(t_win)

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

d1 = math.ceil(c / b)
d2 = math.ceil(a/ d)

if d1 <= d2:
  print("Yes")
else:
  print("No")

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

X =-(-C//B)
Y =-(-A//D)
if X <= Y:
    print('Yes')
else:
    print('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):
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())
taka_hp=a-d
aoki_hp=c-b
while True:
  if aoki_hp <=0:
    print("Yes")
    exit()
  else:
    aoki_hp -= b
    if taka_hp <= 0:
      print("No")
      exit()
    else:
      taka_hp -= d

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

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

Solution (Python):
import math
a,b,c,d = map(int,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())
i=0
while i == 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 = c - b
    if c <= 0:
        ans = 'Yes'
        break
    a = a - d
    if a <= 0:
        ans = 'No'
        break

print(ans)

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

if  -(-c//b) <= -(-a//d):
    print("Yes")
else:
    print("No")

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")
'''
if  -(-c//b) <= -(-a//d):
    print("Yes")
else:
    print("No")

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


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

        break
    
   

  


if a<0 or a==0:
  print("No")
else:
  print("Yes")

Solution (Python):
a,b,c,d=map(int,input().split())
if c%b==0:
    x=c//b
else:
    x=c//b+1
if a%d==0:
    y=a//d
else:
    y=a//d+1


if x>y:
    print("No")
else:
    print("Yes")

Solution (Python):



def main():
    import sys
    input = sys.stdin.readline

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

    while True:
        c -= b

        if c <= 0:
            print('Yes')
            exit()

        a -= d

        if a <= 0:
            print('No')
            exit()


if __name__ == '__main__':
    main()

Solution (Python):
a, b, c, d = map(int, input().split())
tk = a // d
if a - tk * d > 0:
    tk += 1
ao = c // b
if c - ao * b > 0:
    ao += 1
if tk >= ao:
    print('Yes')
else:
    print('No')

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

Solution (Python):

"""
Created on Wed Apr 29 20:56:18 2020
"""

import sys


sys.setrecursionlimit(10 ** 9)


mod = 10**9+7


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


if (c-1) // b <= (a-1) // d:
    ans = 'Yes'
else:
    ans = 'No'
print(ans)

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

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

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

Solution (Python):
from math import ceil, floor

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

takahashi = ceil(A/D)
aoki = ceil(C/B)

if takahashi>=aoki:
    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())




for _ in range(200):
    c-=b
    if c<=0:
        print("Yes")
        break
    else: pass
    a-=d
    if a<=0:
        print("No")
        break
    else: pass

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

while 1:
    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:
    if c - b <= 0:
        print("Yes")
        break
    else:
        c = c - b

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

Solution (Python):
te, to, ae, ao = map(int, input().split())

while True:
    ae -= to
    if ae <= 0:
        break
    te -= ao
    if te <= 0:
        break
        
if ae <= 0:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):



def main():
    hp1, atr1, hp2, atr2 = map(int, input().split())

    turn_takahashi = True
    while True:
        if turn_takahashi:
            hp2 -= atr1
        else:
            hp1 -= atr2

        if hp1 <= 0:
            return "No"
        elif hp2 <= 0:
            return "Yes"

        turn_takahashi = not turn_takahashi


print(main())

Solution (Python):
a,b,c,d = map(int, input().split(' '))
t = (c+b-1)//b
t2 = (a+d-1)//d
if t <= t2:
  print('Yes')
else:
  print('No')

Solution (Python):
t_hp, t_power, a_hp, a_power = map(int, input().split())

while True:
    a_hp -= t_power
    t_hp -= a_power
    if a_hp <= 0:
        print("Yes")
        break
    elif t_hp <= 0:
        print("No")
        break

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

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

takahashiCnt = math.ceil(c/b)
aokiCnt =  math.ceil(a/d)

if takahashiCnt <= aokiCnt:
    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())

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

Solution (Python):


import sys



















def main():
    mod = 1000000007                  
    inf = float('inf')
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():  return int(input())
    def mi():  return map(int, input().split())
    def mi_0(): return map(lambda x: int(x)-1, input().split())
    def lmi(): return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():  return list(input())
    
    
    a, b, c, d = mi()
    while True:
        if a > 0 and c > 0:
            c -= b
        else:
            break
        if a > 0 and c > 0:
            a -= d
        else:
            break
    print('Yes') if a > 0 else print('No')


if __name__ == "__main__":
    main()

Solution (Python):
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()

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

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

t = A // D
a = C // B

if A % D != 0:
    t += 1

if C % B != 0:
    a += 1
    
if t >= a:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()

def main():
    A, B, C, D = map(int, input().split())
    A_dead = (A + D - 1) // D
    C_dead = (C + B - 1) // B
    if A_dead >= C_dead:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Solution (Python):


import math
a, b, c, d = map(int, 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 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())
if (c + b - 1) // b <= ( a + d - 1) // d:
    print("Yes")
else:
    print("No")

Solution (Python):
t_h, t_a, a_h, a_a = [int(i) for i in input().split()]

turn = True
while True:
    if turn:
        a_h -= t_a
    else:
        t_h -= a_a

    turn = not turn

    if a_h <= 0:
        print('Yes')
        break
    if t_h <= 0:
        print('No')
        break

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

for i in range(1000000007):
    if i % 2 == 0:
        C -= B
    else:
        A -= D
    
    if A <= 0 or C <= 0: break

if i % 2 == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
from math import floor,ceil,sqrt,factorial,log
from collections import Counter, deque
from functools import reduce

def S(): return input()
def I(): return int(input())
def MS(): return map(str,input().split())
def MI(): return map(int,input().split())
def FLI(): return [int(i) for i in input().split()]
def LS(): return list(MS())
def LI(): return list(MI())
def LLS(): return [list(map(str, l.split() )) for l in input()]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def LLSN(n: int): return [LS() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]

A,B,C,D = MI()

x = -(-A//D)
y = -(-C//B)

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

Solution (Python):
a = list(map(int, input().rstrip().split()))
A = a[0]
B = a[1]
C = a[2]
D = a[3]

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\n")
        break
    A -= D
    if A <= 0:
        print("No\n")
        break

Solution (Python):
import sys

input_array = input().split()
takahashi_tairyoku = int(input_array[0])
takahashi_kougeki = int(input_array[1])
aoki_tairyoku = int(input_array[2])
aoki_kougeki = int(input_array[3])

while(1):
  aoki_tairyoku -= takahashi_kougeki
  if(aoki_tairyoku <= 0):
    print('Yes')
    sys.exit()
  else:
    takahashi_tairyoku -= aoki_kougeki
    if(takahashi_tairyoku <= 0):
      print('No')
      sys.exit()

Solution (Python):
A, B, C, D = map(int, input().split())
c1 = (C+B-1)//B
c2 = (A+D-1)//D

if c1<=c2:
    print('Yes')
else:
    print('No')

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


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

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

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

A = F[0]
B = F[1]
C = F[2]
D = F[3]

count = 0
while(1):
    if count%2==0:
        C -= B
    else:
        A -= D
    
    count += 1
    if C<=0 or A<=0:
        if C <= 0:
            print('Yes')
            break
        else:
            print('No')
            break

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations,  combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop

INF = float('inf')
NIL = - 1


t, B, a, D = map(int, input().split())

while True:
    a -= B
    if a <= 0:
        print('Yes')
        exit()
    t -= D
    if t <= 0:
        print('No')
        exit()

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

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

Solution (Python):
A, B, C, D = [int(s) for s in input().split()]
turn = 0
while A > 0 and C > 0:
  if turn == 0:
    C -= B
    turn = 1
  else:
    A -= D
    turn = 0
if A > 0:
  print("Yes")
else:
  print("No")

Solution (Python):
a,b,c,d = 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 solve(a, b, c, d):
    for t in range(300):
        if t % 2 == 0:
            c -= b
            if c <= 0:
                return "Yes"
        else:
            a -= d
            if a <= 0:
                return "No"

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

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

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

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(a > 0 and c > 0):
  c -= b
  if c <= 0:
    break
  a -= d
  if a <= 0:
    break
if a > c:
  print('Yes')
else:
  print('No')

Solution (Python):
a, b, c, d = map(int,input().split())
if a % d == 0:
    x = a // d
else:
    x = a // d + 1
if c % b == 0:
    y = c // b
else:
    y = c // b + 1
if y == 1:
    print("Yes")
elif y <= x:
    print("Yes")
else:
    print("No")

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

for i in range(100):
    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 = map(int, input().split())

import math



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

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

Solution (Python):


import math

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

ao = math.ceil(c / b)  
ta = math.ceil(a / d)  

print('Yes' if ao <= ta else 'No')

Solution (Python):


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

while c > 0 and a > 0:
    c -= b
    a -= d

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

Solution (Python):
nums = list(map(int, raw_input().split()))
health = [nums[0], nums[2]]
strength = [nums[1], nums[3]]
turn = 0
while(health[turn] > 0):
    health[1-turn] -= strength[turn]
    turn = 1 - turn
if(turn == 0): print('No')
else: print('Yes')

Solution (Python):
a,b,c,d  = map(int, input().split())
trun = 0
while a > 0 and c > 0:
    if trun == 0:
        c = c - b
        trun = 1
    else:
        a = a - d
        trun = 0

if a <= 0:
    print("No")
else:
    print("Yes")

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,td,ah,ad = map(int,input().split())
x,y = (td+ah-1)//td,(ad+th-1)//ad
if(x<=y):print("Yes")
else:print("No")

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

Solution (Python):

import math

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

if math.ceil(a/d) >= math.ceil(c/b):
    print("Yes")
else:
    print("No")

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

while(1):
    c = c-b

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

Solution (Python):
a, b, c, d = [int(s) for s in 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:
        print("Yes")
        break
    A -= D
    if A <= 0:
        print("No")
        break

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

Solution (Python):
a,b,c,d = map(int,input().split())
if c//b + (c%b>0) <= a//d + (a%d>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:
        print('Yes')
    else:
        A-=D
        if A<=0:
            print('No')

Solution (Python):
takahashi_hp, takahashi_attack, aoki_hp, aoki_attack = map(int, input().split())
a = 0
hps = [aoki_hp, takahashi_hp]
attacks = [takahashi_attack, aoki_attack]


def attack(hp, attack, is_takahashi):
    hp -= attack
    if hp <= 0:
        if is_takahashi:
            print("No")
        else:
            print("Yes")
        exit()
    return hp


def generator():
    global a
    a += 1
    yield a % 2 == 0


while True:
    is_takahashi = generator().__next__()
    hps[is_takahashi] = attack(hps[is_takahashi], attacks[is_takahashi], is_takahashi)

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

while not(a<=0 or c<=0):
        a=a-d
        c=c-b

if a<=0 and c<=0:
        print("Yes\n")
elif a<=0:
        print("No\n")
else:
        print("Yes\n")

Solution (Python):
arr = list(map(int, input().split()))
 
TAKA = 0
AOKI = 1
PH = 0
PW = 1
 
user = [[arr[0], arr[1]], [arr[2], arr[3]]]
 
taka = user[TAKA]
aoki = user[AOKI]
uid = TAKA
 
while (taka[PH] > 0 and aoki[PH] > 0):
  user[(uid + 1) % 2][PH] -= user[uid][PW]
  uid = (uid + 1) % 2
 
  
result = 'No' if taka[PH] <= 0 else 'Yes'
print(result)

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

Solution (Python):
A, B, C, D = list(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 or C > 0 :
    C -= B
    if C <= 0:
        print('Yes',end='\n')
        break
    A -= D
    if A <= 0:
        print('No',end='\n')
        break

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

Solution (Python):
a,b,c,d=(int(x) for x in input().split())
win = 0
while(True):
    c=c-b
    if c <= 0:
        win = 1
        break
    a=a-d
    if a <= 0:
        win = 2
        break
if win == 1:
    print("Yes")
else:
    print("No")

Solution (Python):
a, b, c, d = map(int, input().split())
while 0 <= a or 0 <= c:
  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())
cnt=0
while a>0 and c>0:
  if cnt%2==0:
    c=c-b
  else:
    a=a-d
  cnt+=1
print("Yes" if c<=0 else "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('No')
else:
    print('Yes')

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

while A>0 and C>0:
    C -= B
    if C>0:
        A -= D

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

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

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

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

Solution (Python):
from sys import stdin
import math


def main():
    _in = [_.rstrip() for _ in stdin.readlines()]
    A, B, C, D = list(map(int,_in[0].split(' ')))  
    
    HP_takahashi = A
    HP_aoki = C
    while HP_takahashi-D > 0 or HP_aoki-B > 0:
        HP_aoki -= B
        HP_takahashi -= D
    else:
        if HP_takahashi <= 0 and HP_aoki <= 0:
            TF = 'Yes'
        elif HP_takahashi <= 0:
            TF = 'No'
        else:
            TF = 'Yes'
    
    print(TF)


def ans():
    _in = [_.rstrip() for _ in stdin.readlines()]
    A, B, C, D = list(map(int,_in[0].split(' ')))  
    
    TF = 'Yes' if math.ceil(A/D)>=math.ceil(C/B) else 'No'
    
    print(TF)


if __name__ == "__main__":
    
    ans()

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

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

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

Solution (Python):
a,b,c,d=map(int,input().split())
taka=c/b
ao=a/d
taka=taka if taka==c//b else int(taka)+1
ao=ao if ao==a//d else int(ao)+1
print("Yes" if taka<=ao else "No")

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

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

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

Solution (Python):
a, b, c, d = map(int, input().split())
takahashi_attack = c // b
aoki_attack = a // d
if c % b != 0:
    takahashi_attack += 1
if a % d != 0:
    aoki_attack += 1
if takahashi_attack <= aoki_attack:
    print('Yes')
else:
    print('No')

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

i = 1
while True:
  if i % 2 == 0:
    a -= d
  else:
    c -= b
  i += 1
  if a <= 0 or c <= 0:
    if a <= 0:
      print('No')
    elif c <= 0:
      print('Yes')
    break

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

Solution (Python):
a, b, c, d = list(map(int, input().split())) 
x = int((a+d-1)/d)
y = int((c+b-1)/b)
print("Yes" if x >= y  else "No")

Solution (Python):
from sys import stdin, stdout
import math
import bisect
import queue

a, b, c, d = map(int, stdin.readline().strip().split())

while True:
    c -= b
    if c <= 0:
        stdout.writelines('Yes\n')
        break
    a -= d
    if a <= 0:
        stdout.writelines('No\n')
        break

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

Solution (Python):
def main():
    A, B, C, D = map(int, input().split())
    if -(-C//B) <= -(-A//D):
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

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

A=li[0]
B=li[1]
C=li[2]
D=li[3]

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):
temp=list(map(int,input().rstrip().split()))
a=temp[0]
b=temp[1]
c=temp[2]
d=temp[3]
while True :
    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 = map(int, input().split())
x = (a+d-1)//d
y = (b+c-1)//b
if y <= x:
    print("Yes")
else:
    print("No")

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

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

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

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

Solution (Python):
def f(hp,atk):
	i = 1
	while True:
		if hp - i*atk <= 0:
			return i
		i += 1

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




if f(int(c),int(b)) <= f(int(a),int(d)):
	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' )
        exit()
    A -= D 
    if A <= 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:
        print("Yes")
        exit()
    A -= D
    if A <= 0:
        print("No")
        exit()

Solution (Python):


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

    
    while True:
        c -= b
        if c <= 0:
            print("Yes")
            return

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


main()

Solution (Python):
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()

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


for l in range(100):
    C -= B
    if C <= 0:
        print('Yes')
        break
    A -= D
    if A <= 0:
        print('No')
        break

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


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())
if (math.ceil(C/B)<=math.ceil(A/D)):
    print("Yes")
else:
    print("No")

Solution (Python):

ABCD = input().split(' ')
A = int(ABCD[0])
B = int(ABCD[1])
C = int(ABCD[2])
D = int(ABCD[3])
while A > 0 and C > 0:
    C -= B
    A -= D
if C <= 0:
    print('Yes')
else:
    print('No')

Solution (Python):
th,ta,ah,aa=list(map(int, input().split()))
while True:
    ah-=ta
    if ah<=0:
        print("Yes")
        break
    th-=aa
    if th<=0:
        print("No")
        break

Solution (Python):



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

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

while a>=0 and c>=0:
  c=c-b
  if c<=0:
    print("Yes")
    sys.exit(0)
  a=a-d
  if a<=0:
    print("No")
    sys.exit(0)

Solution (Python):
THP, TAT, AHP, AAT = map(int, input().split())

turn = 0
while True:
  if turn % 2 == 0:
    AHP -= TAT
    if AHP <= 0:
      print("Yes")
      break
  else:
    THP -= AAT
    if THP <= 0:
      print("No")
      break
  turn += 1

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