peterverebics/CodeNet_Python_118 huggingface dataset:
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()
a,b,c,d = map(int,input().split())
aoki=-(-c//b)
taka=-(-a//d)
if aoki>=taka+1:
    print("No")
else:
    print("Yes")
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
def resolve():
    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
    if TA > AA:
        print('No')
    else:
        print('Yes')

if __name__ == '__main__':
    resolve()
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
A, B, C, D = map(int, input().split())
Tcount = 0
Acount = 0
while C > 0:
  C = C -B
  Acount = Acount + 1
while A > 0:
  A = A - D
  Tcount = Tcount + 1
print("Yes" if Tcount >= Acount else "No")
a,b,c,d=map(int,input().split())
while True:
    c=c-b
    if c <= 0:
        print('Yes')
        exit()
    a=a-d
    if a <=0:
        print('No')
        exit()
a, b, c, d = map(int,input().split())
t = c//b
if not c % b == 0:
  t += 1
o = a//d
if not a % d == 0:
  o += 1

if t <= o:
  print('Yes')
else:
  print('No')
t_t,t_a,a_t,a_a=map(int,input().split())

for i in range(101):
    a_t -= t_a
    if a_t <= 0:
        print('Yes')
        break

    t_t -= a_a
    if t_t <= 0:
        print('No')
        break
#!/usr/bin/env python3
#B

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

a,b,c,d = LI()
if math.ceil(c / b) <= math.ceil(a / d):
    print('Yes')
else:
    print('No')
import math
A,B,C,D = map(int,input().split())
a = math.ceil(A/D)
t = math.ceil(C/B)
if t<=a:
    print("Yes")
else:
    print("No")
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().strip().split())
while True:
    c=c-b
    if c<=0:
        print("Yes")
        break
    a=a-d
    if a<=0:
        print("No")
        break
from math import ceil
a, b, c, d = map(int, input().split())
if ceil(a/d) >= ceil(c/b):
  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 True:
    c = c - b
    if c <= 0:
        print("Yes")
        exit()
    a = a-d
    if a <= 0:
        print('No')
        exit()
a,b,c,d = map(int,input().split())
print('YNeos'[(c-1)//b>(a-1)//d::2])
[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%d!=0:
    aoki+=1
if chokudai<=aoki:
    ans="Yes"
print(ans)
a, b, c, d = map(int, input().split())

if c // b + bool(c % b) <= a // d + bool(a % d):
    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())
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())
turn = 0

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

if a > 0:
    print('Yes')
else:
    print('No')
#!/usr/bin/env python
# -*- coding: utf-8 -*-


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

    print(result)


if __name__ == "__main__":
    main()
A,B,C,D=list(map(int, input().split()))
while ((A>0) | (C>0)):
    C=C-B
    if C<=0:
        print("Yes")
        break
    A=A-D
    if A<=0:
        print("No")
        break
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")
            break
        A -= D
        if A <= 0:
            print("No")
            break

if __name__ == '__main__':
    main()
# -*- coding: utf-8 -*-
def main():
    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

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

while a > 0:
    c -= b
    a -= d
    if c <= 0:
        print('Yes')
        break
if c > 0:
    print('No')
# coding: utf-8
from math import ceil
A, B, C, D = map(int, input().split())
t = ceil(C / B)
a = ceil(A / D)
if t == a:
    print("Yes")
elif t < a:
    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 math
a, b, c, d = map(int, input().split())

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

i = 0
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')
import math
a, b, c, d = map(int, input().split())
ta = math.ceil(a/d)
ao = math.ceil(c/b)
if ta >= ao:
    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
	A = A-D
	if C <= 0:
		print("Yes")
		break
	else:
		if A <= 0:
			print("No")
			break
a,b,c,d=map(int,input().split());t=0
while a>0 or c>0:
    if t:
        a-=d
        t=0
    else:
        c-=b
        t=1
print("No"if t else"Yes")
def N():
    return int(input())
def L():
    return list(map(int,input().split()))
def NL(n):
    return [list(map(int,input().split())) for i in range(n)]
mod = pow(10,9)+7
#import numpy


a,b,c,d = L()
ta = -(-c // b)
ao = -(-a//d)
#print(ta,ao)
if ta <= ao :
    print("Yes")
else:
    print("No")
a, b, c, d = map(int, input().split())
flg = True

while True:
    if flg:
        c -= b
        flg = False
    else:
        a -= d
        flg = True

    if a <= 0:
        print('No')
        break
    elif c <= 0:
        print('Yes')
        break
A, B, C, D = map(int, input().split())

while True:
    if C - B >0:
        C -= B
    else:
        print("Yes")
        exit()
    if A - D >0:
        A -= D
    else:
        print("No")
        exit()
t_hp, t_atk, a_hp, a_atk = [int(i) for i in input().split()]

while t_hp > 0 and a_hp > 0 :
  a_hp -= t_atk
  if a_hp <= 0 :
    break
  t_hp -= a_atk
if t_hp <= 0 :
  print('No')
else :
  print('Yes')
A, B, C, D = [int(i) for i in input().split()]

while True:
    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())
f = True
while True:
    if f:
        C = C - B
        f = False
    else:
        A = A - D
        f = True
    if A <= 0:
        print('No')
        break
    elif C <= 0:
        print('Yes')
        break
    else:
        continue
abcd = [int(n) for n in input().split()]
while True:
    abcd[2] -= abcd[1]
    if abcd[2] <= 0:
        print("Yes")
        break
    abcd[0] -= abcd[3]
    if abcd[0] <= 0:
        print("No")
        break
a, b, c, d = map(int, input().split())

if (c-1)//b <= (a-1)//d:
    print('Yes')
else:
    print('No')
a,b,c,d = map(int, input().split())
while True:
    c -= b
    if c <= 0:break
    a -= d
    if a <= 0:break
if a <= 0:
    print("No")
else:
    print("Yes")
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)
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
def resolve():
    A, B, C, D = map(int, input().split())

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


resolve()
a, b, c, d = map(int, input().split())
t = (c + b - 1) // b
a = (a + d - 1) // d
print('Yes' if t <= a else 'No')
# coding: utf-8
# Your code here!
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
import math
 
A, B, C, D = map(int, input().split())

def battle(A, B, C, D):
  C = C-B
  if C <= 0:
    return "Yes"
  A = A-D
  if A <= 0:
    return "No"
  return battle(A,B,C,D)
  
print(battle(A, B, C, D))
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
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())

while True:
    C -= B
    if C <= 0:
        print("Yes")
        break
    A -= D
    if A <= 0:
        print("No")
        break
import math
A = list(map(int, input().split()))
if math.ceil(A[0]/A[3]) >= math.ceil(A[2]/A[1]):
    print("Yes")
else :
    print("No")
A,B,C,D=map(int,input().split())
while True:
    C=C-B
    if(C<=0):
        print('Yes')
        exit()
    A=A-D
    if(A<=0):
        print('No')
        exit()
test = list(map(int, input().split()))
A = test[0] #体力
B = test[1] #攻撃
C = test[2] #体力
D = test[3] #攻撃
flag = True
while flag:
    C -= B
    if C <=0:
        print('Yes')
        flag = False
        break
    A -= D
    if A <= 0:
        print('No')
        flag = False
        break
tkhp, tkat, aohp, aoat = list(map(int, input().split()))

while True:
    aohp -= tkat
    if aohp <= 0:
        print("Yes")
        break

    tkhp -= aoat
    if tkhp <= 0:
        print("No")
        break
import sys
A,B,C,D=map(int,input().split())
while True:
    C-=B
    if C<=0:
        print("Yes")
        sys.exit()
    else:
        A-=D
    if A<=0:
        print("No")
        sys.exit()
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()
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())

max_attack = 0
if(-(-a//d) > -(-c//b)):
    max_attack = int(-(-c//b))
else:
    max_attack = int(-(-a//d))

for cnt in range(0, max_attack):
    c = c - b
    if c <= 0:
        print('Yes')
        break
    a = a - d
    if a <= 0:
        print('No')
import math

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

if math.ceil(A / D) < math.ceil(C / B):
    print('No')
else:
    print('Yes')
def inputlist():
    return [int(i) for i in input().split()]


def main():
    A, B, C, D = inputlist()
    boolTurnTaka = True
    while A > 0 and C > 0:
        if boolTurnTaka:
            C -= B
            boolTurnTaka = False
        else:
            A -= D
            boolTurnTaka = True

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


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

is_turn_of_takahashi = True

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

    is_turn_of_takahashi = not is_turn_of_takahashi

print("Yes" if A > 0 else "No")
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
taka_hp, taka_atk, aoki_hp, aoki_atk = [int(x) for x in input().split()]
a = False
while a == False:
    aoki_hp -= taka_atk
    if aoki_hp <= 0:
        a = True
        print('Yes')
        break
    taka_hp -= aoki_atk
    if taka_hp <= 0:
        a = True
        print('No')
        break
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
a, b, c, d = map(int, input().split())

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

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

while(True):
    c -= b
    a -= d
    if c<= 0:
        print("Yes")
        break
    elif a <= 0:
        print("No")
        break
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 = map(int,input().split())
count=0
while (a>0) and (c>0):
    if count%2==0:
        c-=b
    else:
        a-=d
    count+=1

if  count%2==1:
    print("Yes")
else:
    print("No")
#n=int(input())
a,b,c,d=map(int,input().split())
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]

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())
t_n = (c-1)//b + 1
a_n = (a-1)//d + 1
if t_n <= a_n:
    print('Yes')
else:
    print('No')
A, B, C, D = (int(x) for x in input().split())

while A > 0 and C > 0:
    C = C - B
    A = A - D
    if C <= 0:
        print("Yes")
        break
    else:
        if A <= 0:
            print("No")
            break
s=input().split()
th=int(s[0])
ta=int(s[1])
ah=int(s[2])
aa=int(s[3])

while 1:
  ah=ah-ta
  if ah<1:
    print('Yes')
    break
  th=th-aa
  if th<1:
    print('No')
    break
a, b, c, d = map(int, input().split())

aoki = 0
if a % d == 0:
    aoki = a // d
else:
    aoki = a // d + 1

takahashi = 0
if c % b == 0:
    takahashi = c // b
else:
    takahashi = c // b + 1

if takahashi <= aoki:
    print("Yes")
else:
    print("No")
import math

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

t = A / D
a = C / B

if math.ceil(t) >= math.ceil(a):
    print("Yes")
else:
    print("No")
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
def Bfun():
    vals = [int(i) for i in input().split()]
    a = vals[0]
    b = vals[1]
    c = vals[2]
    d = vals[3]
    res2 = a//d + (1 if(a % d > 0) else 0)
    res1 = c//b + (1 if(c % b > 0) else 0)
    res = "Yes" if(res1 <= res2) else "No"
    print(res)
Bfun()
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')
t_hp,t_at,a_hp,a_at=map(int,input().split())
while(t_hp > 0 and a_hp > 0):
  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())
ta=(C-1)//B+1
tb=(A-1)//D+1
if ta<=tb:
    print ('Yes')
else:
    print ('No')
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
print('Yes' if c <= 0 else 'No')
from math import ceil
a, b, c, d = map(int, input().split())
ans = "Yes" if ceil(a/d) >= ceil(c/b) else "No"
print(ans)
a,b,c,d=map(int,input().split())
co=1
while a>0 and c>0:
    if co%2:
        c-=b
    else:
        a-=d
    co+=1
print("Yes" if a>0 else "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
from math import ceil
A, B, C, D = map(int,input().split())
if ceil(A/D) < ceil(C/B):
    print('No')
else:
    print('Yes')
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
import sys
A, B, C, D = map(int, input().split())

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

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

Takahasi = [A,B]
Aoki = [C,D]

while Aoki[0] > 0 and Takahasi[0] > 0:
    
    n = Aoki[0] - Takahasi[1]
    Aoki[0] = n
    
    if Aoki[0] <= 0:
        print("Yes")
        break    
    
    i = Takahasi[0] - Aoki[1]
    Takahasi[0] = i
    
    if Takahasi[0] <= 0:
        print("No")
        break
a, b, c, d = map(int, input().split(" "))

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

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

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

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

for i in range(300):
    if i%2==0:
        c-=b
    else:
        a-=d
    if a<=0:
        print('No')
        exit()
    if c<=0:
        print('Yes')
        exit()
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
import sys
sys.setrecursionlimit(10**6)
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())
s=(a+d-1)//d
w=(c+b-1)//b
print('Yes' if w<=s else 'No')
a, b, c, d = map(int, input().split())

taka = (a - 1 + d) // d
aoki = (c - 1 + b) // b

if taka < aoki:
    ans = "No"
else:
    ans = "Yes"

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

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


if A<=0:
    print('No')
elif C<=0:
    print('Yes')
A, B, C, D = map(int, input().split())
takahashi = -(-C // B)
aoki = -(-A // D)

if aoki >= takahashi:
    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 = map(int, input().split())

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

#print(ceil(C/B),ceil(A/D))

tkhs_cnt = ceil(C/B)
aok_cnt = ceil(A/D)
ans = "Yes" if aok_cnt >= tkhs_cnt else "No"
print(ans)
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())
while a > 0 and c > 0:
  
  c = c - b
  a = a - d
  
if c <= 0:
  print('Yes')
else:
  print('No')
a,b,c,d=map(int,input().split())
ans="Yes"
while True:
    c-=b
    if(c<=0):break
    a-=d
    if(a<=0):
        ans="No"
        break

print(ans)
a,b,c,d = map(int,input().split())
f=0
while(1):
    c-=b
    if c<=0:
        f=1
        break
    a-=d
    if a<=0:
        f=2
        break

if f==1:
    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
# while文を使うパターン(本番では書けず、あとで修正したもの)
a, b, c, d = map(int, input().split())


turn = 0

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

# どちらかが0以下になった時点で止まるので最後のターンがどちらかを判別
if turn % 2 != 0:
    print('Yes')
else:
    print('No')
import sys
A,B,C,D = list(map(int,input().split()))

while True:
  C = C - B
  A -= D
  if C <= 0:
    print("Yes")
    sys.exit(0)
  elif A <= 0:
    print("No")
    sys.exit(0)
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 _ in range(100):
    a-=d
    c-=b
    if c<1:
        print("Yes")
        exit()
    if a<1:
        print("No")
        exit()
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")
A, B, C, D = map(int, input().split())

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

x = (a+d-1)//d
y = (b+c-1)//b

if x >= y:
	print("Yes")
else:
	print("No")
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(" "))

turn = 0

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

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

aoki = c
takahashi = a

for i in range(101):
  if aoki - b > 0: #高橋の攻撃
    if takahashi - d <= 0: #青木の攻撃で高橋負け
      print("No")
      break
    else: #戦闘続く
      takahashi = takahashi - d
      aoki = aoki - b
      continue
  else: #高橋勝ち
    print("Yes")
    break