peterverebics/CodeNet_Python_118 huggingface dataset:
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
t_life, t_at, a_life, a_at = map(int,input().split())

count=0
while True:
    count+=1
    if t_life<=0:
        print('No')
        break
    elif a_life<=0:
        print('Yes')
        break
    elif count%2==0:
        t_life=t_life-a_at

    else:
        a_life=a_life-t_at
tk_hp, tk_atk, ao_hp, ao_atk = map(int,input().split())


while(1):
    ao_hp -= tk_atk

    if(ao_hp <= 0):
        print("Yes")
        exit()

    tk_hp -=  ao_atk

    if(tk_hp <= 0):
        print("No")
        exit()
import math
A, B, C, D= map(int, input().split())
Nt=math.ceil(A/D) 
Na=math.ceil(C/B) 
if(Nt>=Na):
    print('Yes')
else:
    print('No')
# -*- coding: utf-8 -*-

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


jud_t = math.ceil(a/d)
jud_a = math.ceil(c/b)

if jud_a <= jud_t:
    print("Yes")
else:
    print("No")
line = input().rstrip().split(' ')

a = int(line[0])
b = int(line[1])
c = int(line[2])
d = int(line[3])

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

    a -= d
    if a < 1:
        print('No')
        break
A,B,C,D = map(int,input().split())
for i in range(1000):
    C = C-B
    A = A-D
    if C <= 0:
        print('Yes')
        break
    if A <= 0:
        print('No')
        break
a, b, c, d = map(int, input().split())

cnt = 0
while a > 0 and c > 0:
    if cnt % 2 == 0:
        c -= b
    else:
        a -= d
    cnt += 1
if a <= 0: print("No")
else: print("Yes")
MOD = 10 ** 9 + 7
INF = 10 ** 10
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)

def main():
    a,b,c,d = map(int,input().split())
    i = 0
    while a > 0 and c > 0:
        if i%2 == 0:
            c -= b
            i += 1
        else:
            a -= d
            i += 1
    if i%2 == 0:
        print('No')
    else:
        print('Yes')

if __name__ == '__main__':
    main()
import math

A, B, C, D = list(map(int, input().split()))
tak = math.ceil(A / D)
aok = math.ceil(C / B) 
print(('No', 'Yes')[tak - aok > -1])
a,b,c,d = map(int, raw_input().split(' '))
turn = False
while(a > 0 and c > 0):
    if turn:
        a -= d
    else:
        c -= b
    
    turn = not(turn)
print 'Yes' if a > 0 else 'No'
import math


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

    Takeshi = math.ceil(C/B)
    Aoki = math.ceil(A/D)

    print('Yes' if Takeshi<= Aoki else 'No')


if __name__ == '__main__':
    main()
A,B,C,D = map(int,input().split())
t = 0
while C > 0:
    C -= B
    t += 1
if A - D*(t-1) <= 0:
    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")
        exit()
    A -= D
    if A <= 0:
        print("No")
        exit()
h1, a1, h2, a2 = map(int, input().split())

h2 -= a1
while True:
    if h2 > 0:
        h1 -= a2
    else:
        print("Yes")
        break
    if h1 > 0:
        h2 -= a1
    else:
        print("No")
        break
def main():
    a, b, c, d = map( int, input().split())
    for i in range(300):
        c -= b
        if c <= 0:
            print("Yes")
            return
        a -= d
        if a <= 0:
            print("No")
            return
if __name__ == '__main__':
    main()
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
hp_t, at_t, hp_a, at_a = list(map(int, input().split()))

if(hp_t%at_a == 0 ):
    # 青木の攻撃回数
    num_a = hp_t // at_a
else:
    num_a = hp_t // at_a + 1

if(hp_a%at_t == 0 ):
    # 高橋の攻撃回数
    num_t = hp_a // at_t
else:
    num_t = hp_a // at_t + 1

if(num_a >= num_t):
    print("Yes")
else:
    print("No")
A, B, C, D = map(int, input().split())
while B or D <= 0:
    if C - B <= 0:
        print("Yes")
        break
    else:
        C -= B
        if A - D <= 0:
            print("No")
            break
        else:
            A -=D
def main():
    A,B,C,D=map(int,input().split())
    for i in range(100):
        C-=B
        if C<=0:
            print('Yes')
            exit()
        A-=D
        if A<=0:
            print('No')
            exit()
main()
A,B,C,D = map(int,input().split())
i = 0
j = 0
while C > 0:
    C = C - B
    i += 1
while A > 0:
    A = A - D
    j += 1
if i <= j:
    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')
        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())
if c%b==0:
  tak = c/b
elif c/b<1:
  tak = 1
else:
  tak = c//b +1
if a%d ==0:
  ai = a/d
elif a/d<1:
  ai = 1
else:
  ai=a//d +1
if tak<=ai:
  print("Yes")
else:
  print("No")
a,b,c,d=map(int, input().split())
if a//d<c//b:
  print("Yes")
else:
  print("No")
a,b,c,d = (map(int,input().split()))
while True:
    a = a-d
    if a<=0:
        print ('No')
        break
    c = c-d
    if c<=0:
        print ('Yes')
        break
a,b,c,d=map(int,input().split())
judg=True
while(judg==True):
    a-=d
    if a<=0:
        judg = False
        break
    c-=b
    if c<=0:
        judg = False
        break
if a<=0:
    print("No")
else:
    print("Yes")
a,b,c,d = map(int,input().split())
if(a+b>(c+d)):	print("Yes")
else:	print("No")
a,b,c,d = map(int,input().split())
x=(c+b-1)/b
y=(a+d-1)/d
print(x,y)
if x<=y:
  print("Yes")
else:
  print("No")
A, B, C, D = map(int, input().split())
print("Yes" if (A+D)//D >= (C+B)//B else "No")
A, B, C, D = list(map(int, input().split()))
while True:
    if A - D <= 0:
        print('No')
        break
    else:
        print('Yes')
        break
N = (input().split())
TH = int(N[0])
TP = int(N[1])
AH = int(N[2])
AP = int(N[3])
AI,TI = 0,0
chk = 0
NNa,NNb = 0 ,0

if 1 <= TH <= 100 and 1 <= TP <= 100 and 1 <= AH <= 100 and 1 <= AP <= 100:
  while chk == 1:
    AI += TP
    NNa +=1
    if AI <= AH:
      chk += 1
  chk = 0
  while chk == 1:
    AI += TP
    NNb +=1
    if TI <= TH:
      chk += 1
  if NNa <= NNb:
    print('Yes')
  else:
    print('No')
a, b, c, d=map(int, input().split())

flag = False
for i in range(101):
  a = a-d
  if a <= 0:
    flag = True
    break    
  c = c-b
if True:
  print("No")
else:
  print("Yes")
a, b, c, d = map(int, input().split())
if (a-1)//d >= (b-1)//c:
  print('Yes')
else:
  print('No')
a,b,c,d = map(int,input().split())
if (c//a) < (d//b):
 print("Yes")
else:
 print("No")
a, b, c, d = [int(i) for i in input().split()]
if (a//d)>=(c//b):
    print('Yes')
else:
    print('No')
a,b,c,d=map(int,input().split())

ttol=a%d
atol=c%b

tt=a//d
at=c//d
    
if ttol>=atol:
    print("Yes")
elif tt>at and ttol<atol:
    print("Yes")
else:
    print("No")
a, b, c, d = map(int, input().split())
p = 0
while(c > 0):
    c = c - b
    if c == 0:
        break
    a = a - d
    if a == 0:
        p = 1
        break
if p == 1:
    print("No")
else:
    print("Yes")
[a,b,c,d]=list(map(int,input().split()))
ans="No"
chokudai=c//b
if c%b!=0:
    chokudai+=1
aoki=a//d
if a%b!=0:
    aoki+=1
if chokudai>=aoki:
    ans="Yes"
print(ans)
a,b,c,d=map(int,input().split())
while a>0 and c>0:
    a=a-d
    c=c-b
if a>c:
    print("Yes")
else:
    print("No")
# coding: utf-8
# Your code here!

input_line = input().split()
A_HP = int(input_line[0])
A_ATTACK = int(input_line[1])
B_HP = int(input_line[2])
B_ATTACK = int(input_line[3])

X = A_HP//B_ATTACK
Y = B_HP//A_ATTACK
if X >= Y:
  print('Yes')
    
elif Y > X:
  print('No')

else:
  print('Yes')
a,b,c,d=map(int,input().split())
x=float(a/d)
y=float(c/b)
 
if x>=y:
  print("yes")
elif 0<y-x<=1:
  print("yes")
else:
  print("no")
a,b,c,d = map(int, input().split())
i = 1
while a >= 0 & c >= 0:
    a = a
    c = c - i*b

    a = a-i*d
    c = c

    i += 1
if a <= 0:
    print('No')
else :
    print('Yes')
N = [int(e) for e in input().split()]
if(N[2]%N[1] !=0):
    ans = N[2]//N[1]+1
else:
    ans = N[2]//N[1] 
for i in range(0,ans):
    N[0] -= N[3]
    if(N[0] <= 0):
        print('No')
        break
else:
    print('Yes')
#スペース区切りの整数の入力
tairyoku_A, kougeki_B,tairyoku_C,kougeki_D = map(int, input().split())

one = int(tairyoku_A /kougeki_D)
two = int(tairyoku_C /kougeki_B)


if(one>two):
  print("Yes")
elif(one<two):
  print("No")
else:
  print("Yes")
A, B, C, D = map(int, input().split())

if C/B >= A/D:
  if C%B != 0 and A%D == 0:
    print("No")
    exit()
  print("Yes")
else:
  print("No")
import math
a,b,c,d = map(int,input().split())
#a c hp
#b d atk
t_n = math.ceil(c / b)
a_n = math.ceil(a / d)

if t_n <= a_n:
    print('YES')
else:
    print('NO')
i = list(map(int, input().split()))
while i[0] <= 0 or i[2] <= 0:
    i[2] -= i[1]
    if i[2] <= 0:
        break
    i[0] -= i[3]
    if i[0] <= 0:
        break
if i[0] <= 0:
    print("No")
else:
    print("Yes")
def Next(): return input()
def NextInt(): return int(Next())
def NextInts(): return map(int,input().split())
def Nexts(): return map(str,input().split())
def NextIntList(): return list(map(int,input().split()))
def RowInts(n): return [input() for i in range(n)]

a,b,c,d= NextInts() #高橋体力a 青木体力c

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

while True:
  D -= B
  if D > 0:
    A -= C
    if A <= 0:
      print("No")
      exit()
  else:
    print("Yes")
    exit()
a,b,c,d=list(map(int,input().split()))
print("Yes" if c//b <= a//d else "No")
a, b, c, d = map(int, input().split())
while c >0:
  a -= d
  c -= b
  
if c < 0:
  print("No")
else:
  print("Yes")
a,b,c,d=map(int,input().split())
hpa=a
hpc=c
while (hpa>0) and (hpc>0):
  hpc=hpc-b
  hpa=hpa-d
  
if hpa<=0:
  print("No")

if hpc<=0:
  print("Yes")
S_list = list(map(int,input().split()))
A,B,C,D = S_list
takahashi ,aoki = A, C
while takahashi > 0 or aoki > 0:
    aoki = aoki - B
    if aoki <=0:
        break
    takahashi = takahashi - D
    
if takahashi > aoki:
    result = "Yes"
else:
    result = "No"
print(result)
a,b,c,d = map(int, input().split())

if a//d >= b//c:
  print("Yes")
else:
  print("No")
a,b,c,d=map(int,input().split())
print("Yes" if (c//b+c%b>0)<=(a//d+a%d>0) else "No")
A, B, C, D = map(int, input().split())
print('Yes' if C / B < A / D else 'No')
A,B,C,D = map(int,input().split())
#print(A,B,C,D)
def judge(A,B,C,D):
    for i in range(99):
        C = C-B
        A = A - D
        if C==0:
            return 1
        elif A == 0:
            return 0
if judge(A,B,C,D)==1:
    print("Yes")
else:
    print("No")
a,b,c,d=map(int,input().split())
a=a-d
c=c-b
if a>=c:
  print("Yes")
else:
  print("No")
A,B,C,D=map(int,input().split())
count1=0
count2=0
for i in range(A<=0):
    A=A-D*i
    count1+=1
for n in range(C<=0):
    C=C-B*n
    count2+=1
if count1<=count2:
    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")
  A -= D
  if A <= 0:
    print("No")
[A, B, C, D] = list(map(int, input().split()))
X = A / D
Y = C / B
if X < Y or (X < 0 and Y < 0):
    print('No')
else:
    print('Yes')
A,B,C,D = map(int,input().split())
x = ((A+D)-1)/D
y = ((B+C)-1)/B
if(x>=y):
  print('Yes')
else:
  print('No')
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()
#---khan17---template
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
a, b, c, d = map(int, input().split())
print("Yes") if a+b>c+d else print("No")
A, B, C, D = [int(x) for x in input().split()]

if A + B >= C + D:
    print('Yes')
else:
    print('No')
a,b,c,d=map(int,input().split())
print("No" if a//d - (c//b -1) < 0 else "Yes" if c%b==0 else "No")
HPa,ATa,HPb,ATb=map(int,input().split())
flag = False
for i in range(0,HPa,ATb):
  if HPb < 0:
    flag = True
  HPb = HPb - ATa
if flag:
  print("Yes")
else:
  print("No")
List = input().split()
HP_T = int(List[0])
AT_T = int(List[1])
HP_A = int(List[2])
AT_A = int(List[3])
result = 0

Turn_T = HP_A/AT_T 
Turn_A = HP_T/AT_A 
print(Turn_T, Turn_A)
if Turn_T - Turn_A >= 0:
  result = "No"
else:
  result = "Yes"

print(result)
a, b, c, d = map(int, input().split())
t1, t2 = c//b, a//d
if t1 < t2:
	print('Yes')
else:
	if t2 * d == a:
		print('No')
	else:
		if (t1 + 1) * b == c:
			print('Yes')
		else:
			print('No')
A, B, C, D = map(int, input().split())

n = int(A/D)
m = int(C/B)
i = 1
a = C
t = A


if n>m:
    x = n
else :
    x = m
    
for i in range(1, x+1):
    a = a - B
    t = t - D
    if a <= 0:
        break 
    elif t <= 0:
        break
    
    
if a <= 0:
    print('Yes')
elif t <= 0:
    print('No')
a,b,c,d = map(int,input().split())

aoki = c - b
takahasi = a - d

for i in range(100):
  if i % 2 == 0:
    c -= b
    if c <= 0:
      print('Yes')
      exit()
  elif i % 2 == 1:
    a -= d
    if a <= 0:
      print('No')
      exit()
a, b, c, d = (int(i) for i in input().split())
takahashi = (c+b) // b
aoki = (d+a) // a
if takahashi <= aoki:
    print("No")
else: print("Yes")
import sys

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


def solve():
    a, b, c, d = map(int, rl().split())
    if c % b != 0:
        print('No')
        exit()
    if c % b != 1:
        print('Yes')
    

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

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

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

#高橋　→　青木
# takahashi = a // d
# aoki = c // b


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

takahashi = a
aoki = c

for _ in range(100):
    takahashi -= d
    aoki -= d
    if takahashi <= 0:
        print('No')
        break
    elif aoki <= 0:
        print('Yes')
        break
nums = [int(e) for e in input().split()]

if nums[2]%nums[1] == 0:
    A = nums[2]%nums[1]
else:
    A = nums[2]%nums[1] + 1

if nums[0]%nums[3] == 0:
    T = nums[0]%nums[3]
else:
    T = nums[0]%nums[3] + 1
 
if A <= T:
    print('Yes')
else:
    print('No')
import sys 
import math
try:
	sys.stdin = open('input.txt', 'r') 
	sys.stdout = open('output.txt', 'w')
except:
	pass
input = sys.stdin.readline
for tt in range(1):
	# n = int(input())
	a,b,c,d = map(int,input().split())
	# l = list(map(int,input().split()))
	if math.ceil(a/d)==1:
		print("No")
	elif math.ceil(c/b)-1 <= math.ceil(a/d):
		print ("Yes")
	else:
		print("No")
A, B, C, D = map(int, input().split())

if C//B > A//D or B >= C:
    print('Yes')
else:
    print('No')
A, B, C, D = map(int, input().split(" "))
Takahashi = {
  "attack": A,
  "HP": B
}

Aoki = {
  "attack": C,
  "HP": D
}
# print("resolve", A, B, C, D)
winner = True
while True:
  Aoki["HP"] = Aoki["HP"] - Takahashi["attack"]
  if (Aoki["HP"] <= 0):
    winner = True
    break

  Takahashi["HP"] = Takahashi["HP"] - Aoki["attack"]
  if (Takahashi["HP"] <= 0):
    winner = False
    break

print("Yes" if winner else "No")
a, b, c,d = map(int, input().split())
aa=a
cc=c
for i in range(a//d+1):
    cc = cc - b
    print(cc)
    if cc<1:
      print("Yes")
      break;
    aa = aa - d
    print(aa)
    if aa <1:
      print("No")
      break;
a, b, c, d = map(int, input().split())
if a//d + 1 >= c//b :
  print('Yes')
else:
  print('No')
A, B, C, D = map(int, input().split())
if A == C:
    if B>D:
        print("Yes")
    else:
        print("No")
elif(A>C):
    print("Yes")
elif(C>A):
    print("No")
a,b,c,d = map(int,input().split())

import math

if math.ceil(c/b)>=math.ceil(a/d):
    print('Yes')
else:
    print('None')
A,B,C,D = map(int, input().split())
S = 0
while S != 1:
    A -=B
    C -=D
    if A <= 0:
        S = 1
        print("Yes")
    elif C <= 0:
        S = 1
        print("No")
    else:
        continue
#abc164a

a,b,c,d=map(int,input().split())
x=(a+d-1)/d
y=(c+b-1)/b
if x>=y:
 print('Yes')
else:
 print('No')
A, B, C, D = map(int, input().split())
flg = True
for i in range(2 * max(A, C) + 1):
    if i % 2 == 0:
        C -= B
        print('C: ', C)
        if C <= 0:
            flg = False
            print('Yes')
    else:
        A -= D
        if A <= 0:
            flg = False
            print('No')
    if not flg:
        break
a,b,c,d=map(int,input().split())

for i in range(100):
  if i%2==0:
    c-=b
  else:
    a-=d
  if a<=0:
    print("No")
    break
  if c<=0:
    print("Yes")
    break
#coding UTf-8
a,b,c,d = map(int,input().split())
while True:
    a=a-d;
    if a<=0:
        print("No")
        break;
    c=c-b;
    if c<=0:
        print("Yes")
        break;
A, B, C, D = map(int, input().split())

t = C /B
a = A /D

if t <= a+1 :
    ans = "Yes"
    if A % D == 0 and C % B ==0:
        ans = "Yes"
    elif A % D == 0:
        ans = "No"
    else:
        ans = "Yes"
else:
    ans = "No"
print(ans)
t_h, t_a, a_h, a_a = [int(i) for i in input().split()]
aoki = a_h // t_a
takahashi = t_h // a_a

if aoki <= takahashi:
    print('No')
else:
    print('Yes')
THP, TMP, AHP, AMP = map(int, input().split())
 
if TMP == AHP:
  print('Yes')

else:
  while AHP > 0 and THP > 0:
  
    AHP = AHP - TMP
    THP = THP - AHP
  
  if AHP > THP:
    print('Yes')

  else:
    print('No')
A, B, C, D = map(int, input().split())
if A-C <= 1:
    if B-D <= 0:
        print("No")
    else:
        print("Yes")
else:
        print("Yes")
a = list(map(int, input().split()))
if a[0]+a[1] <= a[2] + a[3]:
  print('No')
else:
  print('Yes')
n, m, c, d = map(int, input().split())
if (n - m) < (c -d) or (n - m) == 0:
    print("No")
else:
    print("Yes")
th,ta,ah,aa = map(int,input().split())

at = ah / ta
tt = th / aa

if at >= tt:
  print("No")
elif at <= tt:
  print("Yes")
A, B, C, D = map(int, input().split())
print("Yes") if A > C else print("No")
input_line = input().split()
A = int(input_line[0])
B = int(input_line[1])
C = int(input_line[2])
D = int(input_line[3])

X = A//D
Y = C//B
if X > Y:
  print('Yes')
    
elif Y > X:
  print('No')

elif X ==Y:
  print('Yes')
a,b,c,d = map(int,input().split())
aoki_new = b-c
taka_new1 = d-a
if taka_new1 < aoki_new :
	print("No") #takahasi is loses because its heath is zero first
else:
	print("Yes")
import math 
a,b,c,d=map(int,input().split())
print("Yes") if math.ceil(c/a)>=math.ceil(a/d) else print("No")
A,B,C,D = map(int, input().split())
for i in range(1,201):
  while A > 0 and C > 0:
    if i%2==1:
      C=C-B*(((i-1)/2)+1)
    if i%2==0:
      A=A-D*(i/2)
  if A > 0 and C < 0:
    print('Yes')
  if A < 0 and C > 0:
    print('No')
A,B,C,D = map(int,input().split())
while True:
  C = C - B
  if C <= 0:
    print('C:',C)
    break
  A = A - D
  if A <= 0:
    print('A:',A)
    break
print('Yes' if A >= C else 'no')
A,B,C,D = [int(_n) for _n in input().split()]
taka = C / B + (0 if C % B == 0 else 1)
aoki = A / D + (0 if A % D == 0 else 1)
print("Yes" if taka <= aoki else "No")
A, B, C, D = map(int, input().split())

T_HP = A
T_AT = B
A_HP = C
A_AT = D
T_count = 0
A_count = 0

while T_HP >= 0:
    T_HP -= T_AT
    T_count += 1
while A_HP >= 0:
    A_HP -= A_AT
    A_count += 1

if T_count > A_count:
    print('Yes')
else:
    print('No')
a,b,c,d = map(int,input().split())
if c%b < a%d:
    print("Yes")
else:
    print("No")
a, b, c, d=map(int, input().split())

if (a+b)%2 ==1 and (c+d)%2==0 or (a+b)%2==(c+d)%2:
    print("No")
else:
    print("Yes")
a, b, c, d = map(int, input().split())

if (a//d) < (c//b):
    print("No")
elif ((a//d) == (c//b)) and (c%b != 0) and (a%d == 0):
    print("No")
else:
    print("Yes")
A, B, C, D = map(int, input().split())
while 0==0:
    D -= B
    # print(D)
    if D <= 0:
        print("Yes")
        exit(0)
    A -= C
    # print(A)
    if A <= 0:
        print("No")
        exit(0)
A, B, C, D = map(int, input().split())
if A-B <= 0:
    print("No")
elif D-C <= 0:
    print("No")
else:
    print("Yes")
import math
List = input().split()
HP_T = int(List[0])
AT_T = int(List[1])
HP_A = int(List[2])
AT_A = int(List[3])
result = 0

Turn_T = math.ceil(HP_A/AT_T)
Turn_A = math.ceil(HP_T/AT_A)
print(Turn_T, Turn_A)
if Turn_T - Turn_A == 0:
  result = "Yes"  
if Turn_T - Turn_A < 0:
  result = "Yes"
if Turn_T - Turn_A > 0:
  result = "No"

print(result)
a,b,c,d=map(int,input().split())
x=float(a/d)
y=float(c/b)
 
if x>=y:
  print("yes")
elif 0<x-y<1:
  print("yes")
else:
  print("no")
s = [input() for i in range(1)] 
li = list(map(int, s[0].split()))
t = li[0]
a = li[2]
for i in range(0,100):
    if i % 2 == 0:
        a = a - li[1]
        if a <= 0:
            print("Yes")
            break
    if i % 2 == 1:
        t = t - li[3]
        if t <= 0:
            print("No")
            break
A,B,C,D=map(int,input().split())

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

if A+B > D+C:
    print("Yes")
else:
    print("No")
a,b,c,d = map(int,input().split())

import math
k = math.ceil(c/b)
l = math.ceil(a/d)

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

for i in range(1,101):
	if i/2 % 1 :
		c = c-b
		print('c',c)
	else:
		a = a-d
		print('a',a)
	
	if a <= 0:
		print('No')
		break
	elif c <= 0:
		print('Yes')
		break
tt,ta,at,aa=map(int,input().split())
 
for i in range(100):
 if at-ta>0:
    at-=ta
 elif at-ta<=0:
    print("Yes")
 elif tt-aa>0:
     tt=-aa
 elif tt-aa<=0:
    print("No")
A, B, C, D = map(int, input().split())
first = A-C
second = B-D
if (A>C):
    if first >= second:
        print("No")
    else:
        print("Yes")
elif(A==C):
    if B>D:
        print("Yes")
    else:
        print("No")
else:
    if first >= second:
        print("Yes")
    else:
        print("No")
a,b,c,d = list(map(int,input().split()));

if a//d < c//b :
    print('Yes');
else :
    print('No');
class monster:
    stamina = 0
    attack= 0
    def __init__(self,stamina,attack):
        self.stamina = stamina
        self.attack = attack


abcd = input().split()
abcd=[int(x) for x in abcd]
a = abcd[0]
b = abcd[1]
c = abcd[2]
d = abcd[3]



taka = monster(a,b)
aoki = monster(c,d)

while(1):
    aoki.stamina = aoki.stamina-taka.attack
    if aoki.stamina<=0:
        print('No')
        break
    taka.stamina = taka.stamina-aoki.attack
    if taka.stamina<=0 :
        print('Yes')
        break
a,b,c,d=map(int,input().split())
x = a/d
y = c/b
if 1 <= x and 1 <= y:
    print('Yes')
else:
    print('Yes' if x <= y else 'No')
a,b,c,d = map(int,input().split())
if(a+b>=c+d):
  print("Yes")
else:
  print("No")
A,B,C,D = map(int,input().split())
#print(A,B,C,D)

while A > 0:
    C -= B
    A -= D
    if C <= 0:
        print("Yes")
        
    elif A <= 0:
        print("No")
    else:
        pass
import math
A, B, C, D = input().split()
 
if math.ceil(int(C)*1.0/(int(B)*1.0)) >= math.ceil(int(A)*1.0/(int(D)*1.0)):
  print("Yes")
else:
  print("No")
a,b,c,d=list(map(int,input().split()))
if a/d > c/b:
    print("Yes")
else:
    print("No")
a,b,c,d = map(int,input().split())

#print(a,b,c,d)

while((a or c) > 0):
    c -= b
    a -= d
    #print(a,c)

if(c == 0):
    print('Yes')
else:
    print('No')
A,B,C,D = map(int, input().split())
T=0
A=0
while C-B>0:
    C-=B
    T+=1
while A-D>0:
    A-=D
    A+=1
print("Yes") if A>=T else print("No")
a, b, c, d = map(int, input().split())

num1 = a//d
num2 = c//d

if num1>num2:
  print('Yes')
else:
  print('No')
A, B, C, D = map(int, input().split())
takahasi = C // B
aoki = A // D
if C % B != 0:
    takahasi += 1
if A % D  != 0:
    aoki += 1 
if takahasi > aoki:
    print("Yes")
else:
    print("No")
A,B,C,D=map(int,input().split())
if int(C/B)>int(A/D):
    print('No')
else:
    print('Yes')
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
if A <= 0:
    print('No')
else:
    print('Yes')
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
d = int(x[3])
while a > 0 or c > 0:
  c = c - b
  a = a - d
if c <= 0:
  print('Yes')
else:
  print('No')