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):
import sys
input = sys.stdin.readline

"""

"""

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

i = 0
while True:
    a_health, a_damage = monsters[i]
    d_health, d_damage = monsters[(i+1)% 2]

    d_health -= a_damage

    if d_health <= 0:
        if i == 0:
            print("Yes")
        else:
            print("No")
        break
    
    monsters[i] = (a_health, a_damage)
    monsters[(i+1)% 2] = (d_health, d_damage)
    i = (i+1) % 2

Solution (Python):
from sys import stdin, stdout
a, b, c ,d = map(int, stdin.readline().strip().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')

Solution (Python):

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

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

for _ in range(10000):
  C = C-B
  if C <= 0:
    print('Yes')
    exit(0)
  A = A-D
  if A <= 0:
    print('No')
    exit(0)

Solution (Python):
import sys
from math import ceil


def main():
    input = sys.stdin.buffer.readline
    a, b, c, d = map(int, input().split())
    print('Yes' if ceil(a / d) >= ceil(c / b) else 'No')


if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

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

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

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

if n % 2 == 1:
    print('Yes')
else:
    print('No')

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

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

if tak > aok:
  print("No")
else:
  print("Yes")

Solution (Python):
def 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
if __name__ == '__main__':
    main()

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

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

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

turn = 0

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

if turn == 0:
    print('No')
else:
    print('Yes')

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):
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")
        exit()
    
    a-=d
    if a<=0:
        print("No")
        exit()

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

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

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

Solution (Python):
def attack(player,enemy):
    enemy[0] -= player[1]
    if(enemy[0] <= 0):
        return 1
    else:
        return -1

def resolve():
    data = [int(i) for i in input().split()]

    takahasi = [data[0],data[1]]
    aoki = [data[2],data[3]]
    
    while(True):
        flag = attack(takahasi,aoki)
        if(flag == 1):
            print("Yes")
            break
        flag = attack(aoki,takahasi)
        if(flag == 1):
            print("No")
            break
resolve()

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

Solution (Python):
a,b,c,d=map(int,input().split())
count=0
for i in range(100):
  turn1=c-b
  c=turn1
  count+=1
  if c<=0:
    break

newcount=0
for i in range(100):
  turn2=a-d
  a=turn2
  newcount+=1
  if a<=0:
    break

if count<=newcount:
  print('Yes')
else:
  print('No')

Solution (Python):
def takahashi_win(A,B,C,D):
    while True:
        C -= B
        if C<=0:
            return "Yes"
        A -= D
        if A <= 0:
            return "No"
    

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

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

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

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

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

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

Solution (Python):
import math

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

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

if Takahashi <= Aoki:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
vt,at,va,aa = map(int,input().split())
while True:
  va -= at
  if va<=0:
    ans = 'Yes'
    break
  vt -= aa
  if vt<=0:
    ans = 'No'
    break
print(ans)

Solution (Python):
def attack(hp,attack):
    result = hp - attack
    return result

input = list(map(int, input().split()))
hp_takahashi = input[0]
attack_takahashi = input[1]
hp_aoki = input[2]
attack_aoki = input[3]
result = 10

while result > 1:
    hp_aoki = attack(hp_aoki,attack_takahashi)
    if hp_aoki < 1:
        print("Yes")
        break
    else:
        hp_takahashi = attack(hp_takahashi,attack_aoki)
        if hp_takahashi < 1:
            print("No")
            break

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

Solution (Python):
A,B,C,D = map(int,input().split())
a = A//D
if A%D != 0:
    a += 1
c = C//B
if C%B != 0:
    c += 1

if a >= c:
    print("Yes")
else:
    print("No")

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

Solution (Python):
def round_up(x):
    if x>int(x):
        return int(x)+1
    else:
        return int(x)
a,b,c,d=map(int,input().split())
m,n=round_up(c/b),round_up(a/d)

print('No' if m>n else 'Yes')

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

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

if(takahashi > aoki):
    print("No")

else:
    print("Yes")

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


while a>0:

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

Solution (Python):
import math as m
h1,s1,h2,s2=map(int,input().split())
a1=m.ceil(h2/s1)
a2=m.ceil(h1/s2)
if a2<a1:
    print("No")
else:
    print("Yes")

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

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

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

Solution (Python):
thhp, that, aohp, aoat = map(int, input().split())

while True:
    aohp -= that
    if aohp <= 0:
        print('Yes')
        break
        
    thhp -= aoat
    if thhp <= 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())

aoki = c - b
takahasi = a - d

for i in range(10000):
  if i % 2 == 0:
    c -= b
    if c <= 0:
      print('Yes')
      exit()
  elif i % 2 == 1:
    a -= d
    if a <= 0:
      print('No')
      exit()

Solution (Python):
t_hp, t_atk, a_hp, a_atk = map(int, input().split())
t_life_span = -(-t_hp//a_atk)
a_life_span = -(-a_hp//t_atk)
print("Yes" if t_life_span >= a_life_span else "No")

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

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

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

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

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):
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())
i = 0
while a > 0 and c > 0:
    c -= b
    i += 1
    if c > 0:
        a -= d
        i += 1

if i % 2 == 1:
    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())
k=0
while (a>0 and c>0):
    c-=b
    a-=d
if c<=0:
    k='Yes'
if k==0:
    k='No'
print(k)

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

while True:
    C -= B
    if C <= 0:
        ans = 'Yes'
        break
    A -= D
    if A <= 0:
        ans = 'No'
        break

print(ans)

Solution (Python):
nums = input().split(" ")
a = int(nums[0])
b = int(nums[1])
c = int(nums[2])
d = int(nums[3])

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

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

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

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

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

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

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

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

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

    print(ans)
resolve()

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

Solution (Python):
import math

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

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

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

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

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

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

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


main()

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

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

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

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

if a<=0 and c<=0:
    print("Yes")

elif a<=0:
    print("No")

else:
    print("Yes")

Solution (Python):
a, b, c, d = map(int, input().split())
count_T = (c-1)//b + 1
count_A = (a-1)//d + 1

if count_T > count_A:
  print("No")
else:
  print("Yes")

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

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

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

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

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

print("No")

Solution (Python):
a,b,c,d = map(int,input().split())
T = (c-1)//b
A = (a-1)//d
if T<=A:
    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 1:
    C -= B
    if C <= 0:
        print("Yes")
        break
    A -= D
    if A <= 0:
        print("No")
        break

Solution (Python):
import math

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

TK = math.ceil(C / B)
AO = math.ceil(A / D)

print('Yes' if TK <= AO else 'No')

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

myturn=a//d
yourturn=c//b
e=a%d
f=c%b

if e!=0:
  myturn+=1
if f!=0:
  yourturn+=1

if myturn>=yourturn:
  print("Yes")
else:
  print("No")

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):
t_life, t_attack, a_life, a_attack = map(int, input().split())

while t_life >= 0 and a_life >= 0:
    a_life = a_life - t_attack
    if a_life <= 0:
        print('Yes')
        exit()

    t_life = t_life - a_attack
    if t_life <= 0:
        print('No')
        exit()

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):
a,b,c,d = map(int,input().split())

f = False
while a > 0 < c:
    f = not f
    if f:
        c -= b
    else:
        a -= d

if f:
    print("Yes")
else:
    print("No")

Solution (Python):
import math

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

Solution (Python):
import math

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

x = math.ceil(c / b)
y = math.ceil(a / d)

if x <= y:
    ans = 'Yes'

print(ans)

Solution (Python):
class Monster:
    def __init__(self, health, strength):
        self.health = health
        self.strength = strength

a = list(map(int, input().split()))

t_monster = Monster(*a[:2])
a_monster = Monster(*a[2:])

i = 0
while t_monster.health > 0 and a_monster.health > 0:
    if i % 2 == 0:
        a_monster.health -= t_monster.strength
    else:
        t_monster.health -= a_monster.strength
    i += 1

if t_monster.health > 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 = list(map(int, input().split()))
q1,r1 = divmod(c,b)
q2,r2 = divmod(a,d)
tak=q1+min(1,r1)
aoki=q2+min(1,r2)

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

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

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

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

Solution (Python):
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
d = int(x[3])
while a > 0 and c > 0:
  c = c - b
  a = a - d
if c <= 0:
  print('Yes')
else:
  print('No')

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

Solution (Python):
HPa, B, HPc, D = [int(i) for i in input().split()]

while HPa>0:
    HPc = HPc - B
    if HPc <= 0:
        print("Yes")
        break
    else:
        HPa = HPa - D
        if HPa <= 0:
            print("No")
            break

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

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

    elif(C <= 0):
        print("Yes")
        break

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

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

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

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

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

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

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

Solution (Python):
from math import ceil

A,x,B,y=map(int,input().split())

if ceil(B/x)<=ceil(A/y):
    print("Yes")
else:
    print("No")

Solution (Python):
from math import ceil

h_t, s_t, h_a, s_a = map(int, input().split())

count_t = ceil(h_t/s_a)
count_a = ceil(h_a/s_t)

print('Yes' if count_t >= count_a else 'No')

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

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

def ceil(a, b):
    if a%b == 0:
        return a//b
    else:
        return (a//b) + 1

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


if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):
x =list(map(int,input().split()))
y = x[2] - x[1]
z = x[0] - x[3]
if y <= 0:
    print('Yes')
elif z <= 0:
    print('No')
else:
    while True:
        y = y - x[1]
        z = z - x[3]
        if y <= 0 or z <= 0:
            break
    if y <= 0 :
      print('Yes')
    elif y <= 0 and z <= 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):
t_health, t_attack, a_health, a_attack = map(int, input().split())

is_t_turn = True
while(t_health > 0 and a_health > 0):
    if is_t_turn:
        a_health -= t_attack
    else:
        t_health -= a_attack

    is_t_turn = not is_t_turn

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

Solution (Python):


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

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

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


if __name__ == "__main__":
    solve()

Solution (Python):
from math import ceil

h_t,s_t,h_a,s_a = list(map(int, input().split()))

bearable_t = ceil(h_t/s_a)
bearable_a = ceil(h_a/s_t)

if bearable_t >= bearable_a:
    print('Yes')

else:
    print('No')

Solution (Python):
from math import ceil

h_t,s_t,h_a,s_a = list(map(int, input().split()))

bearable_t = ceil(h_t/s_a)
bearable_a = ceil(h_a/s_t)

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

Solution (Python):
I=input("").split(" ")
t_HP=int(I[0])
t_att=int(I[1])
a_HP=int(I[2])
a_att=int(I[3])

T_turn =True
while t_HP>0 and a_HP>0:
    if T_turn:
        a_HP=a_HP-t_att
        T_turn=False
    else:
        t_HP=t_HP-a_att
        T_turn=True

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

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

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

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

while A > 0 and 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())
n=0
k=0
while a>0 :
    a-=d
    n+=1
while c>0:
    c-=b
    k+=1
if n>=k:
    print('Yes')
else:
    print('No')

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

while (1):
        C -= B
        if C <= 0:
                break
        A -= D
        if A <= 0:
                break

if 0 < A:
        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):
import math
t_health, t_strength, a_health, a_strength = list(map(int, input().split()))

count_a = math.ceil(a_health / t_strength)
count_t = math.ceil(t_health / a_strength)

print("Yes" if count_t >= count_a else "No")

Solution (Python):
import math
t_health, t_strength, a_health, a_strength = list(map(int, input().split()))

count_a = math.ceil(a_health / t_strength)
count_t = math.ceil(t_health / a_strength)

if count_a == count_t:
  print("Yes")
else:
  print("Yes" if count_t > count_a else "No")

Solution (Python):
thp, ta, ahp, aa = map(int, input().split())

while True:
  ahp -= ta
  if ahp <= 0:
      print("Yes")
      break
  
  thp -= aa
  if thp <= 0:
      print("No")
      break

Solution (Python):
import sys
import math

readline = sys.stdin.readline
readall = sys.stdin.read
ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))
prl = lambda x: print(*x ,sep='\n')

a,b,c,d = nm()

a_hp = math.ceil(a/d)
b_hp = math.ceil(c/b)

if a_hp >= b_hp:
    print('Yes')
else:
    print('No')

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

while True:
    if c <= count * b:
        print('Yes')
        break
    elif a <= count * d:
        print('No')
        break
    count = count + 1

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

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

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

Solution (Python):

import math


def resolve():
    AHP, AAT, BHP, BAT = list(map(int, input().split()))

    TurnToDieA = math.ceil(AHP / BAT)
    TurnToDieB = math.ceil(BHP / AAT)

    if TurnToDieA < TurnToDieB:
        print('No')
    else:
        print('Yes')

resolve()

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

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

Solution (Python):
A, B, C, D = [int(n) for n in input().split(' ')]
 
while True:
  C -= B
  if C <=0:
    print("Yes")
    break
  A-=D
  if A<=0:
    print("No")
    break

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

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

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

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

if (A+D-1)//D >= (C+B-1)//B:
    print("Yes")
else:
    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
    

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

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

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

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

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

Solution (Python):
import math

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

if math.ceil(C/B)<=math.ceil(A/D):
    print('Yes')
else:
    print('No')

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

aoki_hp = -(-c // b)
taka_hp = -(-a // d)

if aoki_hp > taka_hp:
    print("No")
else:
    print("Yes")

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

Solution (Python):
import sys

def ISI(): return map(int, sys.stdin.readline().rstrip().split())

a, b, c, d =ISI()
while(1):
	c -= b
	if c<1:
		print("Yes")
		break
	a -= d
	if a<1:
		print("No")
		break

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


if __name__ == "__main__":
    main()

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

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

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

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

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

while a >= 0:
  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 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())
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)

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