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):
com =list(map(int,input().split()))
t_s = com[0]
t_a = com[1]
a_s = com[2]
a_a = com[3]
while 1:
    a_s -= t_a
    if a_s <= 0:
        print("Yes")
        break
    t_s -= a_a
    if t_s <= 0:
        print("No")
        break

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

if A>0:
    print('Yes')
else:
    if A+D>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")
        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:
    break
  A = A - D
  if A <= 0:
    break
print('Yes' if A > 0 else 'No')

Solution (Python):
a,b,c,d=map(int,input().split())
takahashi=c//b
if c%b!=0:
  takahashi+=1
aoki=a//d
if a%d!=0:
  aoki+=1

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

Solution (Python):
s = input().split()

A = int(s[0])
B = int(s[1])
C = int(s[2])
D = int(s[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())
if (a-1)//d >= (c-1)//b:
    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:
    print("Yes")
else:
    print("No")

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

for i in range(1, 10000):
    if i%2 != 0:
        c -= b
    else:
        a -= d

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

Solution (Python):
li = list(map(int,input().split()))
takahashiturn=int(li[2]/li[1])
if li[2]%li[1]!=0:
    takahashiturn+=1
aokiturn=int(li[0]/li[3])
if li[0]%li[3]!=0:
    aokiturn+=1
if takahashiturn<=aokiturn:
    print('Yes')
else:
    print('No')

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

max = max(a,c)

for i in range(max):
    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 -= B
  if C <= 0:
    print("Yes")
    break
  A -= D
  if A <= 0:
    print("No")
    break

Solution (Python):
[a, b, c, d] = [int(i) for i in input().split()]
while a > 0 and c > 0:
    c -= b
    a -= d
if c <= 0:
    print("Yes")
else:
    print("No")

Solution (Python):
a=list(map(int,input().split(" ")))
A=a[2]
B=a[0]
while True:
    A-=a[1]
    if A<=0:
        print("Yes")
        break
    B-=a[3]
    if B<=0:
        print("No")
        break

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

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

Solution (Python):
t_life, t_attack, a_life, a_attack = list(map(int, input().split()))

t_c = 0
a_c = 0

while True:
    a_life -= t_attack
    t_c += 1
    if a_life <= 0:
        break


while True:
    t_life -= a_attack
    a_c += 1
    if t_life <= 0:
        break

if t_c <= a_c:
    print('Yes')
else:
    print('No')

Solution (Python):
str = input().split()
a = int(str[0])
b = int(str[1])
c = int(str[2])
d = int(str[3])
num = 0
while num == 0 :
    c = c - b
    if c <= 0:
        print("Yes")
        break
    a = a - d
    if a <= 0:
        print("No")
        break

Solution (Python):
a = list(map(int, input().split()))
th = a[0]
ta = a[1]
ah = a[2]
aa = a[3]

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

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

main()

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

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

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

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

def helper(a, b, c, d):
    global round
    round += 1
    if a<=0:
        return False
    else:
        c -= b
        return helper(c, d, a, b)
helper(A, B, C, D)
if round%2==0:print('Yes')
else:print('No')

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

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

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

Solution (Python):
h1, a1, h2, a2 = map(int, input().split())

ans = None
while True:
  h2 -= a1
  if h2 <= 0:
    ans = "Yes"
    break
  h1 -= a2
  if h1 <= 0:
    ans = "No"
    break

print(ans)

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

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

Solution (Python):
def io():
    return map(int,input().split())
def op():
    return list(map(int,input().split()))
a,b,c,d=io()
while 1:
    c=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 i in range(1000):
    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())
for i in range(100):
    c -= b
    if c <=0:
        print('Yes')
        exit()
    else:
        a -= d
    if a <=0:
        print('No')
        exit()

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):
from math import *
from copy import *
from string import *				
from random import *
from sys import stdin
from sys import maxsize
from operator import *				
from itertools import *
from collections import Counter		
import math

def bin1(l,r,k,t,b,val,ans):
	if(l>r):
		return ans
	else:
		mid=(l+r)//2
		v=k**mid
		if(v==val):
			return v
		elif(v>val):
			ans=mid
			return bin1(mid+1,r,k,t,b,val,ans)
		else:
			return bin1(l,mid-1,k,t,b,val,ans)
		
def bin2(l,r,k,t,b,val,ans):
	if(l>r):
		return ans
	else:
		mid=(l+r)//2
		v=t*(k**mid)+b*(mid)
		if(v==val):
			return v
		elif(v>val):
			ans=mid
			return bin2(l,mid-1,k,t,b,val,ans)
		else:
			return bin2(mid+1,r,k,t,b,val,ans)

def SieveOfEratosthenes(n): 
      
    
    
    
    prime = [True for i in range(n+1)] 
    p = 2
    while (p * p <= n): 
          
        
        if (prime[p] == True): 
              
            
            for i in range(p * p, n+1, p): 
                prime[i] = False
        p += 1
    l=[]
    for i in range(2,n+1):
    	if(prime[i]):
    		l.append(i)
    return l
def bin(l,r,ll,val):
	if(l>r):
		return -1
	else:
		mid=(l+r)//2
		if(val>=ll[mid][0] and val<=ll[mid][1]):
			return mid
		elif(val<ll[mid][0]):
			return bin(l,mid-1,ll,val)
		else:
			return bin(mid+1,r,ll,val)
def deci(n):
	s=""
	while(n!=0):
		if(n%2==0):
			n=n//2
			s="0"+s
		else:
			n=n//2
			s="1"+s
	return s
def diff(s1,s2):
	if(len(s1)<len(s2)):
		v=len(s1)
		while(v!=len(s2)):
			s1="0"+s1
			v=v+1
	else:
		v=len(s2)
		while(v!=len(s1)):
			s2="0"+s2
			v=v+1
	c=0
	for i in range(len(s1)):
		if(s1[i:i+1]!=s2[i:i+1]):
			c=c+1
	return c
from sys import stdin, stdout 
def fac(a,b):
	v=a
	while(a!=b):
		v*=a-1
		a=a-1
	return v
def bino(l,r,n):
	if(l>r):
		return -1
	else:
		mid=(l+r)//2
		val1=math.log((n/mid)+1,2)
		val2=int(val1)
		if(val1==val2):
			return val1
		elif(val1<1.0):
			return bino(l,mid-1,n)
		else:
			return bino(mid+1,r,n)

def binary(l,r,ll,val,ans):
	if(l>r):
		return ans
	else:
		mid=(l+r)//2
		if(val%ll[mid]==0):
			ans=ll[mid]
			return binary(l,mid-1,ll,val,ans)
		else:
			return binary(l,mid-1,ll,val,ans)
def odd(n,ans,s):
	if(n%2!=0 or n in s):
		return ans
	else:
		s.add(n)
		return odd(n//2,ans+1,s)

if __name__ == '__main__':
	a,b,c,d=map(int,input().split(" "))
	c1=0
	while(a>0 and c>0):
		if(c1==0):
			c-=b
			c1=1
		else:
			a-=d
			c1=0
	if(a<1):
		print("No")
	else:
		print("Yes")

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

Solution (Python):

arg = list(map(int, input().split()))
A = arg[0]
B = arg[1]
C = arg[2]
D = arg[3]

while True:
  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 = map(int, input().split())
t_attack = -(-1*C // B)
a_attack = -(-1*A // D)

if t_attack <= a_attack:
    print("Yes")
else:
    print('No')

Solution (Python):
import math

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

num_A = math.ceil(C/B)
num_B = math.ceil(A/D)

if num_A <= num_B:
    print('Yes')
else:
    print('No')

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

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

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

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


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

Solution (Python):
num = input().split(' ')
lifeTakahashi = int(num[0])
attackTakahashi = int(num[1])
lifeAoki = int(num[2])
attackAoki = int(num[3])

while lifeTakahashi > 0:
  lifeAoki = lifeAoki - attackTakahashi
  if(lifeAoki > 0):
    lifeTakahashi = lifeTakahashi - attackAoki
    continue
  else:
    print('Yes')
    break

if(lifeTakahashi <= 0):
  print('No')

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

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

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

Solution (Python):
import numpy as np


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

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

if aoki > taka:
    print("No")
else:
    print("Yes")

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

Solution (Python):
params = input().split(' ')
takahashi_monster = {
    'life': int(params[0]),
    'attack': int(params[1]),
    'dead': False
}
aoki_monster = {
    'life': int(params[2]),
    'attack': int(params[3]),
    'dead': False
}

while takahashi_monster['dead'] == False and aoki_monster['dead'] == False:
    aoki_monster['life'] = aoki_monster['life'] - takahashi_monster['attack']
    if aoki_monster['life'] <= 0:
        aoki_monster['dead'] = True
        print('Yes')
        break
    takahashi_monster['life'] = takahashi_monster['life'] - aoki_monster['attack']
    if takahashi_monster['life'] <= 0:
        takahashi_monster['dead'] = True
        print('No')
        break

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

while 1:

  c=c-b

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

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

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

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

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

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

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

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

print("No")

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

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

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

Solution (Python):
a=list(map(int,input().split(" ")))
A=a[2]
B=a[0]
while True:
    A-=a[1]
    if A<=0:
        print("Yes")
        break
    B-=a[3]
    if B<=0:
        print("No")
        break

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

if not turn:
    print("No")
else:
    print("Yes")

Solution (Python):
import sys
stdin = sys.stdin
     
pi=3.1415
import sys
stdin = sys.stdin
     
pi=3.1415
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

A,B,C,D=nm()

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

print('Yes' if T==1 else 'No')

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

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

Solution (Python):
a,b,c,d=[int(x) for x in input().split()]
if (c-1)//b > (a-1)//d:
  print("No")
else:
  print("Yes")

Solution (Python):


def main():
    args = input().rstrip().split(' ')
    A, B, C, D = int(args[0]),int(args[1]),int(args[2]), \
                 int(args[3])
    chance = A / D
    if(chance.is_integer() == False):
        chance = int(chance) + 1
    
    if(C <= B*chance):
        print('Yes')
    else:
        print('No')
    
if __name__ == "__main__":
    main()

Solution (Python):
a=input()
a=a.split()
b=0
while b==0:
    
    a[2]=int(a[2])-int(a[1])
    if int(a[2])<=0:
        print("Yes")
        break
    a[0]=int(a[0])-int(a[3])
    if int(a[0])<=0:
        print("No")
        break

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

while (A > 0) & (C > 0):
    C = C - B
    if(C > 0):
        pass
    else:
        print('Yes')
        break
    A = A - D
    if(A > 0):
        pass
    else:
        print('No')
        break

Solution (Python):
A,B,C,D=(int(x) for x in input().split())
T=(C + B - 1) // B
AO=(A + D - 1)// D
if T<=AO: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):
from sys import stdin
a,b,c,d = [int(x) for x in stdin.readline().rstrip().split()]
if a % d == 0:
    aa = a / d
else:
    aa = a//d +1
if c % b == 0:
    bb = c / b
else:
    bb = c//b +1
if aa >= bb:
    print('Yes')
else:
    print('No')

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

t,a=l[0],l[2]
tc,ac=0,0

while t>0:
    t=t-l[3]
    tc+=1
while a>0:
    a=a-l[1]
    ac+=1


if tc>=ac:
    print('Yes')
else:
    print('No')

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

Solution (Python):






inputs: list = []
while True:
    try:
        inputs.append(input().strip('\n'))
    except EOFError:
        break



a, b, c, d = [int(i) for i in inputs[0].split(' ')]

takahashi = {
    'attack': b,
    'hp': a
}
aoki = {
    'attack': d,
    'hp': c
}


def battle(direction=True):

    if direction:
        aoki['hp'] -= takahashi['attack']
    else:
        takahashi['hp'] -= aoki['attack']

    if aoki['hp'] <= 0:
        print('Yes')
        return None
    if takahashi['hp'] <= 0:
        print('No')
        return None

    if direction:
        battle(direction=False)
    else:
        battle(direction=True)


battle(direction=True)

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

Solution (Python):
class Monster():
    def __init__(self, health, attack):
        self.hlt = health
        self.atk = attack

    def attack(self, opponent):
        opponent.hlt -= self.atk


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

takahashi = Monster(a, b)
aoki = Monster(c, d)
players = [takahashi, aoki]
while True:
    attacker, attackee = players
    attacker.attack(attackee)
    if attackee.hlt <= 0:
        break
    players.reverse()

print('Yes' if takahashi.hlt > 0 else 'No')

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

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

e = a//d + (0 if a%d == 0 else 1)
f = c//b + (0 if c%b == 0 else 1)
print("Yes" if e>=f else "No")

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

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

if A > 0: print("Yes")
else: print("No")

Solution (Python):
import sys
a,b,c,d=map(int,input().split())
e=max(a//d+1,c//b+1)
for i in range(2*(e+1)):
    if i%2!=0:
        a-=d
        if a<=0:
            print('No')
            sys.exit()
    else:
        c-=b
        if c<=0:
            print('Yes')
            sys.exit()

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

e=a//d
f=c//b

if a % d == 0:
    e -= 1
if c % b == 0:
    f -= 1

if e >= f:
    print("Yes")
else:
    print("No")

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

if a <= 0:
    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):
def check(a,b,c,d):
	while(a>0 and c>0):
		c-=b
		if(c<=0):
			return 1
		a-=d
		if(a<=0):
			return 0
inp1=list(map(int,input().strip().split()))[:4]
a,b,c,d=inp1[0],inp1[1],inp1[2],inp1[3]
if(check(a,b,c,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):
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())
att_cnt = 0

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

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

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

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

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

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

Solution (Python):
A, B, C, D = [int(x) for x in input().split()]
s = C // B
if C % B != 0:
  s += 1
t = A // D
if A % D != 0:
  t += 1
if s <= t:
  print("Yes")
else:
  print("No")

Solution (Python):
import math
import sys

stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))
mod = 10**9 + 7 
sys.setrecursionlimit(1000010)


A,B,C,D = nm()
x = (C+B-1)//B
y = (A+D-1)//D


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

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

if c%b==0:
    taka = c/b
else :
    taka = (c-c%b)/b + 1

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

if aoki < taka:
    print("No")
else :
    print("Yes")

Solution (Python):
import numpy as np
if __name__ == "__main__":
    
    
    
    a_hp, a_at, b_hp, b_at = map(int, input().split())
    ans = ''
    
    
    
    
    while True:
        b_hp -= a_at
        
        if b_hp <= 0:
            ans = 'Yes'
            break
        a_hp -= b_at
        
        if a_hp <= 0:
            ans = 'No'
            break
    
    print(ans)

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

  for i in range(100):
    C -= B
    if C <= 0:
      print('Yes')
      exit()
    else:
      pass
    A -= D
    if A <= 0:
      print('No')
      exit()
    else:
      pass 

if __name__ == "__main__":
  main()

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

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

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

ans = "No"

while a > 0:
    a = a - d
    c = c - b
    
    if c <= 0:
        ans = "Yes"
        break


print(ans)

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

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

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

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

Solution (Python):
def main():
    inputs = input().split(' ')
    takahashi_hp = int(inputs[0])
    takahashi_pw = int(inputs[1])
    aoki_hp = int(inputs[2])
    aoki_pw = int(inputs[3])

    flag = True
    cnt = 1
    while flag:
        if cnt % 2 == 1:
            aoki_hp -= takahashi_pw
            if aoki_hp <= 0:
                flag = False
                result = 'Yes'
        
        else:
            takahashi_hp -= aoki_pw
            if takahashi_hp <= 0:
                flag = False
                result = 'No'

        cnt += 1

    print(result)

if __name__ == '__main__':
    main()

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

takahashi = A//D
aoki = C//B
if A % D != 0:
    takahashi += 1
if C % B != 0:
    aoki +=1

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

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

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




takahasi = -(-A // D)
aoki = -(-C // B)





if takahasi >= aoki:
    print("Yes")
else:
    print("No")

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

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

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

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

while N[0]>0 and N[2]>0:
    N[2] -= N[1]
    if N[2]<1:
        print('Yes')
        sys.exit()
    N[0] -= N[3]
    if N[0]<1:
        print('No')
        sys.exit()

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

takahashi = math.ceil(c / b)
aoki = math.ceil(a / d)
print("Yes" if takahashi <= aoki else "No")

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

check = False
while(A > 0 and C > 0):
    C -= B
    if(C <= 0):
        check = True
        print('Yes')
        break
    A -= D

if check == False:
    print('No')

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

if(taka_hp > ao_hp):
    print('Yes')
elif(taka_hp < ao_hp):
    print('No')
else:
    print('Yes')

Solution (Python):
al, aa, bl, ba = map(int, input().split())

if al%ba == 0:
    bn = al//ba
else:
    bn = al//ba + 1

if bl%aa == 0:
    an = bl//aa
else:
    an = bl//aa + 1


if an <= bn:
    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):

import heapq
from collections import defaultdict, deque
from math import ceil, factorial, gcd
from itertools import accumulate
import sys
import bisect

sys.setrecursionlimit(10 ** 7)
INF = float("inf")
MOD = 10 ** 9 + 7

si = lambda: input().strip()
ii = lambda: int(input())
mii = lambda: map(int, input().split())
lmii = lambda: list(map(int, input().split()))
lmsi = lambda: list(map(str, input().split()))
smii = lambda: sorted(map(int, input().split()))



A, B, C, D = mii()

takahasi = True
while A > 0 and C > 0:
    if takahasi:
        C -= B
    else:
        A -= D
    takahasi = not takahasi

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

Solution (Python):

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

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

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

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

TH=a
TA=b
AH=c
AA=d

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

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

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

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())
aoki = c
taka = a
for i in range(max((c // b)+1, (a // d)+1)):
    aoki -= b
    taka -= d
    if aoki <= 0:
        print("Yes")
        break
    elif taka <=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')
    break
  a -= d
  if a<=0:
    print('No')
    break

Solution (Python):
a, b, c, d = map(int, input().split())
import sys
for i in range(10000):
    if (c-(b*i))<=0:
        print('Yes')
        sys.exit()
    elif (a-(d*i))<=0:
        print('No')
        sys.exit()

Solution (Python):
import math

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

Solution (Python):
a, b, c, d = map(int, input().split())
A = c
T = a
while(A > 0 and T > 0):
  A -= b
  T -= d
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")
        break
    else:a-=d
    if a<=0:
        print("No")
        break

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

print("No")

Solution (Python):
ok=True
i=0
a,b,c,d=map(int,input().split())
k=c//b
c-=b*k
a-=d*(k)
if(a<=0 and c!=0):
    print("No")
else:
    print("Yes")