peterverebics/CodeNet_Python_118 huggingface dataset:
a,b,c,d = map(int,input().split())
tk = 0
ao = 0
if c % b != 0:
  tk = c//b + 1
else:
  tk = c//b
if a % d != 0:
  ao = a//d + 1
else:
  ao = a//d
if tk <= ao:
  print("Yes")
else:
  print("No")
def main():
    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()
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()
th,ta,ah,aa=map(int,input().split(" "))
#print(th,ta,ah,aa)
#print((ah-1)//ta,(th-1)//aa)
if (ah-1)//ta > (th-1)//aa:
  print("No")
elif (ah-1)//ta <= (th-1)//aa:
  print("Yes")
A,B,C,D = map(int,input().split())

if -(-C//B) > -(-A//D):
    print("No")
else:
    print("Yes")
A,B,C,D = map(int,input().split(" "))
Takahasi = [A,B]
Aoki = [C,D]
while(1):
    Aoki[0]-=Takahasi[1]
    if Aoki[0]<=0:
        print("Yes")
        break
    Takahasi[0]-=Aoki[1]
    if Takahasi[0]<=0:
        print("No")
        break
import math
a,b,c,d = map(int,input().split())

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

if t <= o:
    print('Yes')
else:
    print('No')
k = list(map(int, input().split() ) )
t = 1
while k[0] > 0 and k[2] > 0:
  if t == 1:
    k[2] -= k[1]
    t=2
  else:
    k[0] -= k[3]
    t=1
if t==2:
  print("Yes")
else:
  print("No")
A, B, C, D = map(int, input().split())
while 1:
    C -= B
    if C <= 0:
        print('Yes')
        exit()
    A -= D
    if A <= 0:
        print('No')
        exit()
A, B, C, D =map( int, input().split() )

takahashi_win = False
while (A > 0) and ( C > 0 ):
    C -= B
    if C <= 0:
        takahashi_win = True
    A -= D
if takahashi_win:
    print('Yes')
else:
    print('No')
a,b,c,d = map(int,input().split())

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

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

num1 = math.ceil(c / b)
num2 = math.ceil(a / d)

if num1 <= num2:
    print('Yes')
else:
    print('No')
a, b, c, d = map(int, input().split())

if ( c - 1 ) // b + 1 <= (a - 1) // d + 1 :
  print("Yes")
else:
  print("No")
#!/usr/bin/env python3

A, B, C, D= map(int, input().split())
while A > 0 or C > 0:
    C -= B
    if C <= 0:
        ans = "Yes"
        break
    A -= D
    if A <= 0:
        ans = "No"
        break
print(ans)
from sys import stdin
import math
import fractions

a, b, c, d = [int(x) for x in stdin.readline().rstrip().split()]

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

a, b, c, d= i.split()
a = int(a)
b = int(b)
c = int(c)
d = int(d)

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

if a < 1:
    print('No')
else:
    print('Yes')
def get_ints():
    return list(map(int, input().split()))

a, b, c, d = get_ints()
while True:
    c -= b
    if c <= 0:
        print('Yes')
        exit(0)
    a -= d
    if a <= 0:
        print('No')
        exit(0)
[A,B,C,D] = [int(s) for s in input().rstrip().split(' ')]
t = -(-A//D)
a = -(-C//B)
if t >= a:
    print("Yes")
else:
    print("No")
a,b,c,d = map(int, input().split())
ans='Yes'
while a>0 and c>0:
    c-=b
    if c<=0:
        break
    a-=d
    if a<=0:
        ans='No'
        break
print(ans)
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')
a, b, c, d = map(int, input().split())

turn = 1
while a > 0 and c > 0:
    if turn == 1:
        c -= b
    else:
        a -= d
    turn *= -1

if a <= 0:
    print("No")
else:
    print("Yes")
inp_ls = input().split(" ")
a,b,c,d = [int(e) for e in inp_ls[:4]]

turn = 0
while True:
	if a <= 0:
		print("No")
		break
	if c <= 0:
		print("Yes")
		break
	if turn % 2 == 0:
		c -= b
	else:
		a -= d
	turn += 1
import math

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

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

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

isWin = False
while not isWin:
  if a <= 0 or c <= 0:
    if a <= 0 and c > 0:
      print('No')
      exit()
    else:
      print('Yes')
      exit()
  a -= d
  c -= b
T_h, T_s, A_h, A_s = map(int, input().split())

# Turns that each need to win
T_t = (A_h + T_s - 1) // T_s # Y
A_t = (T_h + A_s - 1) // A_s # X

if T_t <= A_t:
    print("Yes")
else:
    print("No")
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
A, B, C, D = map(int, input().split())

turn_flag = True
for i in range(0, 100):
    if turn_flag:
        C -= B
        if C <= 0:
            break
        turn_flag = False
    
    else:
        A -= D
        if A <= 0:
            break
        turn_flag = True

    # print(A,B,C,D)

if turn_flag:
    print('Yes')
else:
    print('No')
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")
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
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)
import collections
import sys
import numpy as np
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
MOD = 10**9+7
import itertools
import math

a,b,c,d = map(int,input().split())
i = 0
cnt1 = 0
while True:
    if a<=0:
        break
    cnt1+=1
    a -= d
cnt2 = 0
while True:
    if c<=0:
        break
    cnt2+=1
    c -= b
if cnt1<cnt2:
    print("No")
else:
    print("Yes")
# 164 B

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

while a != 0 or c != 0:
    c = c - b
    if c <= 0:
        print("Yes")
        break
    a = a - d
    if a <= 0:
        print("No")
        break
import sys
import numpy as np
a, b, c, d = map(int, sys.stdin.readline().strip().split())

attack_t = np.ceil(c / b)
attack_a = np.ceil(a / d)

if attack_t <= attack_a:
    print('Yes')
else:
    print('No')
# B
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
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
import sys
import math
# input処理を高速化する
input = sys.stdin.readline

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

while True:
    C=C-B
    if C<=0:
        print('Yes')
        exit(0)
    A=A-D
    if A<=0:
        print('No')
        exit(0)
a, b, c, d = input().split()
a = int(a)
b = int(b)
c = int(c)
d = int(d)
while True:
    c = c - b
    if c <= 0:
        print("Yes")
        break
    a = a - d
    if a<=0:
        print("No")
        break
A, B, C, D = input().split(" ")
A, B, C, D = int(A), int(B), int(C), int(D)

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

from math import ceil
if ceil(A/D) >= ceil(C/B):
    print("Yes")
    exit()

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

l = c // b
if c % b !=0:
  l += 1
  
m = a // d
if a % d !=0:
  m += 1
  
if l == m:
  print("Yes")
elif l < m:
  print("Yes")
else:
  print("No")
def main():
    import sys
    A,B,C,D=map(int,input().split())
    for i in range(100):
        A=A-D
        C=C-B
        if C<=0:
            print("Yes")
            sys.exit()
        elif A<=0:
            print("No")
            sys.exit()
        

    

if __name__ == '__main__':
    main()
a, b, c, d=map(int,input().split())
for i in range(100):
    c = c -b
    if c <= 0:
        print('Yes')
        break
    a = a - d
    if a <= 0:
        print('No')
        break
import math
a,b,c,d = map(int,input().split())

a = math.ceil(a/d)
b = math.ceil(c/b)
if a<b:
  print('No')
else:
  print('Yes')
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
A,B,C,D = map(int,input().split())

Takahashi_HP = A
Takahashi_Damage = B
Aoki_HP = C
Aoki_Damage = D

while Takahashi_HP > 0 or  Aoki_HP > C:
    Aoki_HP -= Takahashi_Damage
    if Aoki_HP <= 0:
        print('Yes')
        break
    Takahashi_HP -= Aoki_Damage
    if Takahashi_HP <= 0:   
        print('No')
        break
a, b, c, d = map(int, input().split())

t_hp = a
a_hp = c

while True:
    a_hp -= b
    if a_hp <= 0:
        print('Yes')
        exit(0)
    t_hp -= d
    if t_hp <= 0:
        print("No")
        exit(0)
import numpy as np
import math

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

takalife = math.ceil(a/d);
aolife = math.ceil(c/b);

if takalife==aolife or takalife>aolife:
  print("Yes");
else:
  print("No")
turn = "A"
A, B, C, D = map(int, input().split(' '))

while A > 0 and B > 0:
    if turn == "A":
        C -= B
        turn = "C"
        if not C > 0:
            print('Yes')
            break
    else:
        A -= D
        turn = "A"
        if not A > 0:
            print('No')
            break
A, B, C, D = map(int, input().split())
while True:
    if C <= B:
        print("Yes")
        break
    if A <= D:
        print("No")
        break
    A -= D
    C -= B
A, B, C, D = map(int, input().split())
Ta = -(-C//B)
Ao = -(-A//D)
print('Yes' if Ta <= Ao else 'No')
import math
a,b,c,d= map(int,input().split())
i = math.ceil(c/b)
j = math.ceil(a/d)
if i <= j:
    print("Yes")
else:
    print("No")
a,b,c,d=map(int,input().split())
ans="No"
for i in range(100):
    c=c-b
    if c<=0:
        ans="Yes"
        break
    a=a-d
    if a<=0:
        break
print(ans)
from math import ceil

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

if ceil(C/B) <= ceil(A/D):
  print("Yes")
else:
  print("No")
A, B, C, D = list(map(int, input().split()))

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

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

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

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

while (A>0 or C>0):
    C-=B

    if C <= 0:
        ans='Yes'
        break;

    A-=D

    if A <= 0:
        ans='No'
        break;

print(ans)
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')
A,B,C,D = map(int,input().split())
Flag = False

while Flag == False:
    C = C - B
    if C <= 0 :
        Flag = True
        break
    A = A - D
    if A <= 0 :
        break

if Flag == True :
    print('Yes')
else :
    print('No')
a,b,c,d = map(int,input().split())
while(a>=0 or c>=0):
    c-=b
    if c<=0:
        print("Yes")
        break
    a-=d
    if a<=0:
        print("No")
        break
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()
#https://atcoder.jp/contests/abc164/tasks/abc164_b
A,B,C,D = map(int,input().split())
Senkou_N,Senkou_Amari = divmod(C,B)
if Senkou_Amari != 0:
    Senkou_N += 1
Koukou_N,Koukou_Amari = divmod(A,D)
if Koukou_Amari != 0:
    Koukou_N += 1

if Senkou_N <= Koukou_N:
    print("Yes")
else:
    print("No")
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
import sys

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

while True:
    C -= B
    if C <= 0:
        print("Yes")
        sys.exit()
    A -= D
    if A <= 0:
        print("No")
        sys.exit()
thp,tat,ahp,aat = map(int,input().split())
while True:
    ahp -= tat
    if ahp <= 0:
        print("Yes")
        break
    thp -= aat
    if thp <= 0:
        print("No")
        break
a,b,c,d=map(int,input().split())
if (c+b-1)//b<=(a+d-1)//d:print("Yes")
else:print("No")
A, B, C, D = list(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')
T_HP, T_AT, A_HP, A_AT = map(int, input().split())
while True:
  A_HP -= T_AT
  if A_HP <= 0:
    print("Yes")
    break
  T_HP -= A_AT
  if T_HP <= 0:
    print("No")
    break
A, B, C, D = map(int, input().split())
while A > 0 or C > 0:
  C -= B
  if C <= 0:
    print("Yes")
    break
  A -= D
  if A <= 0:
    print("No")
    break
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()
import math

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

n = math.ceil(a / d)
m = math.ceil(c / b)

if n >= m:
    print('Yes')
else:
    print('No')
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")
a_life, a_attk, b_life, b_attk = [int(i) for i in input().split()]

i = 0
while(True):
  if i % 2 == 0:
    b_life -= a_attk
  else:
    a_life -= b_attk
  i += 1
  if b_life <= 0:
    print("Yes")
    break
  elif a_life <= 0:
    print("No")
    break
def solution():
    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

solution()
import sys

inp=input().split(" ")
thp=int(inp[0])
tat=int(inp[1])
ahp=int(inp[2])
aat=int(inp[3])

for i in range(100):
  ahp-=tat
  if ahp<=0:
    print("Yes")
    sys.exit()
  thp-=aat
  if thp<=0:
    print("No")
    sys.exit()
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')
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
a, b, c, d = map(int, input().split())

ta = c//b if c % b == 0 else c//b + 1
aa = a//d if a % d == 0 else a//d + 1

print('No' if ta > aa else 'Yes')
A,B,C,D=map(int,input().split())

while True:
    if C-B<=0:
        print('Yes')
        exit()
    if A-D<=0:
        print('No')
        exit()
    C-=B
    A-=D
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()
A, B, C, D = map(int, input().split())

import math

A_attack = math.ceil(C / B)
B_attack = math.ceil(A / D)

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

# a = 10
# b = 2
# c = 10
# d = 3

while True:
#     print(a)
#     print(c)
    
    c = c - b
    
    if c <= 0:
        print('Yes')
        break
            
    a = a - d
            
    if a <= 0:
        print('No')
        break
#coding UTf-8
a,b,c,d = (int(x) for x in input().split())
while True:
  c=c-b;
  if c<=0:
        print("Yes")
        break;
  a=a-d;
  if a<=0:
        print("No")
        break;
heart_taka, power_taka, heart_aoki, power_aoki = map(int, input().split())

aliveTaka = True
aliveAoki = True
while (aliveTaka) and (aliveAoki):
    heart_aoki -= power_taka
    heart_taka -= power_aoki
    if heart_aoki <= 0:
        aliveAoki = False
    if heart_taka <= 0:
        aliveTaka = False

if aliveAoki == False:
    print("Yes")
else:
    print("No")
A, B, C, D = [int(i) for i in input().split()]
 
while A or C > 0:
  C -= B
  if C<=0:
    print('Yes')
    break
  A -= D
  if A<= 0:
    print('No')
    break
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
A, B, C, D = map(int, input().split())

for i in range(999999):
    C -= B
    if C <= 0:
        print('Yes')
        break
    A -= D
    if A <= 0:
        print('No')
        break
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()
A, B, C, D = map(int, input().split())

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

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

while A > 0 and C > 0:
    C -= B
    if C <= 0:
        print("Yes")
        sys.exit()
    A -= D

print("No")
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
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
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
import sys
readline = sys.stdin.buffer.readline
t1,t2,a1,a2= list(map(int,readline().rstrip().split()))
nnn = lambda x: 0 if x == 0 else 1  
if a1//t2 + nnn(a1%t2) <= t1//a2 + nnn(t1%a2):
  print('Yes')
else:
  print('No')
a, b, c, d = map(int, input().split())

ao = a // d + 1
taka = c // b + 1

if c % b == 0:
  taka -= 1
if a % d == 0:
  ao -= 1
  
if taka<=ao:
    print("Yes")
else:
    print("No")
S=list(map(int,input().split()))
while True:
  S[2]=S[2]-S[1]
  S[0]=S[0]-S[3]
  if S[2]<=0:
    print("Yes")
    break
  elif S[0]<=0:
    print("No")
    break
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
A,B,C,D = (int(x) for x in input().split())
while(C > 0 and A > 0 ):
    C -= B
    if(C <= 0):
        print("Yes")
        break
    A -= D
    if(A <= 0):
        print("No")
        break
A,B,C,D = map(int, input().split())

while A > 0 or C > 0:
    C -= B
    if C <= 0:
        print("Yes")
        break
    A -= D
    if A <= 0:
        print("No")
        break
A,B,C,D=map(int,input().split())
flag=True
while A >0 and C>0:
    C = C-B
    if C<=0:
        print('Yes')
        flag = False
        break
    A = A-D
if flag:
    print('No')
a,b,c,d = map(int,input().split())


while(1):
    c -= b
    if(c <= 0):
        print('Yes')
        exit()
    a -= d
    if(a <= 0):
        print('No')
        exit()
import math
A, B, C, D = map(int, input().split())

taka = math.ceil(A/D)
aoki = math.ceil(C/B)

if taka < aoki:
  print('No')
else:
  print('Yes')
import sys
si = sys.stdin.readline


def main():
    l = [int(e) for e in si().split()]
    Tcnt, Acnt = 0, 0
    while l[0] > 0:
        l[0] -= l[3]
        Tcnt += 1
    while l[2] > 0:
        l[2] -= l[1]
        Acnt += 1
    if Tcnt >= Acnt:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()
import math
a, b, c, d = map(int, input().split())

if math.ceil(c / b) <= math.ceil(a / d):
    print('Yes')
else:
    print('No')
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')
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
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
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)
a,b,c,d=map(int,input().split())
while a*c!=0:
    c-=b
    if c<=0:
        print("Yes")
        exit()
    else:
        a-=d
        if a<=0:
            print("No")
            exit()
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')
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


def solve():
    A, B, C, D = map(int, rl().split())
    for i in range(200):
        if i % 2 == 0:
            C -= B
            if C <= 0:
                print('Yes')
                exit()
        else:
            A -= D
            if A <= 0:
                print('No')
                exit()


if __name__ == '__main__':
    solve()
import sys

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()
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')
A, B, C, D = map(int, input().split())

a = (A + (D-1))//D
c = (C + (B-1))//B

print('Yes'if a >= c else 'No')
A,B,C,D = map(int,input().split())

n = 1

while C > n*B and A > n*D :
    n += 1

if C <= n*B :
    print("Yes")
else : print("No")
from math import ceil
A, B, C, D = map(int, input().split())
time_A, time_C = ceil(A/D), ceil(C/B)
print('Yes') if time_A >= time_C else print('No')
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
abcd=list(map(int, input().split()))
[a,b,c,d]=abcd

while c>0 and a>0:
    c=c-b
    a=a-d
if c>0:
    print('No')
elif a>0:
    print('Yes')
else:
    print('Yes')
A,B,C,D = map(int, input().split())
f = True#高橋くんが勝つ
while True:
    C = C -B
    if C <= 0:
        f = True
        break
    A = A - D
    if A <= 0:
        f = False
        break
if f:
    print('Yes')
else:
    print('No')
A,B,C,D = map(int,input().split())
if A%D==0:
    counter_ao=A//D
else:
    counter_ao=A//D+1

if C%B==0:
    counter_ta=C//B
else:
    counter_ta=C//B+1

if counter_ao >= counter_ta :
    print("Yes")
else:
    print("No")
from sys import stdin
import math

A, B, C, D = list(map(int, input().split()))
attacks_till_a_win = math.ceil(C / B)
if D * (attacks_till_a_win - 1) < A:
    print('Yes')
else:
    print('No')
#!/usr/bin/python3
# -*- coding: utf-8 -*-
a, b, c, d = map(int, input().split())
if (c + b - 1) // b <= ( a + d - 1) // d:
    print("Yes")
else:
    print("No")
a, b, c, d = map(int, input().split())

turn = 0
state = [[a, b], [c, d]]

while state[0][0] > 0 and state[1][0] > 0:
    opp = 1 - turn
    state[opp][0] = state[opp][0] - state[turn][1]
    turn = opp

if state[0][0] <= 0:
    print("No")
else:
    print("Yes")
def fight(A,B,C,D):
  i = 1
  while A>0 and C>0:
    if i%2!=0:
      C -= B
    else:
      A -= D
    i+=1
  if A<=0:
    print('No')
  else:
    print('Yes')
    
if __name__=='__main__':
  A,B,C,D = map(int,input().split())
  fight(A,B,C,D)