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

while True:
    
    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())
count = 1
hp = 1
result = ""
while hp > 0:
    if count % 2 == 1:
        c -= b
        hp = c
        count += 1
        if hp <= 0:
            result = 'Yes'
    else:
        a -= d
        hp = a
        count += 1
        if hp <= 0:
            result = 'No'

print(result)

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

flg = 0
loop = 0

while loop==0:

  if flg ==0:
    c = c - b
    if c <= 0:
      loop = 1
    flg = 1
  else:
    a = a -d
    if a <= 0:
      loop = 1
    flg = 0

if flg == 1:
  print('Yes')
else:
  print('No')

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

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

while A>0 or C>0:
  C-=B
  if C<=0:
    print("Yes")
    sys.exit()
  A-=D
  if A<=0:
    print("No")
    sys.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):
import math


def printYN(c): print("Yes") if c else print("No")


a, b, c, d = [int(w) for w in input().split()]

cond = math.ceil(a / d) >= math.ceil(c / b)
printYN(cond)

Solution (Python):
import sys
import math

from collections import defaultdict
from collections import deque
def load(vtype=int):
    return vtype(input().strip())
def load_list(seplator=" ", vtype=int):
    return [vtype(v) for v in input().strip().split(seplator)]
def exit():
    import sys
    sys.exit(0)
def perm_sub(li, used):
    if len(li) == len(used):
        return [deque()]
    k = []
    for i in range(len(li)):
        if i in used:
            continue
        used.add(i)
        sub_list = perm_sub(li, used)
        for sub in sub_list:
            sub.appendleft(li[i])
        k.extend(sub_list)
        used.discard(i)
    return k
def perm_li(li):
    return perm_sub(li, set())
def perm_n(n):
    return perm_sub(list(range(n)), set())
def join_i(li, sep=""):
    return sep.join([str(e) for e in li])
def li2n(li):
    n, base = 0, 1
    for i in range(len(li)-1, -1, -1):
        n += li[i] * base
        base *= 10
    return n
def sli2ili(li):
    return [int(s) for s in li] 
def prime_list(n):
    li = [i for i in range(2, n+1)]
    for i in range(len(li)):
        if li[i] >= int(math.sqrt(n)):
            break
        if li[i] == -1:
            continue
        for j in range(i+1, len(li)):
            if li[j] % li[i] == 0:
                li[j] = -1
    return [n for n in li if n != -1]
def gcd(a, b):
    a, b = max(a, b), min(a, b)
    while True:
        r = a % b
        if r == 0: return b
        a, b = b, r
def lcm(a, b):
    return int(a * b / gcd(a,b))
def all_subset(li):
    s = []
    n = len(li)
    for bit in range(0, (1<<(n+1))):
        ss = set()
        for i in range(0, n):
            if (bit & (1 << i)):
                ss.add(li[i])
        s.append(ss)
    return s
def factorial(n):
    if n == 1:
        return 1
    return n * factorial(n-1)
def mCn(m, n):
    def factorial_ntimes(m, n):
        r = 1
        while n:
            r *= m
            m -= 1
            n -= 1
        return r
    return int(factorial_ntimes(m, n) / factorial(n))

a,b,c,d = load_list()

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

    turn = not turn

Solution (Python):
import math


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

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

if x >= y:
	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):


num = input().split()
thp = int(num[0])
tatk = int(num[1])
ahp = int(num[2])
aatk = int(num[3])

turn = 1

while thp > 0 and ahp > 0:
    if turn % 2 == 1:
        ahp -= tatk
        turn += 1
        if ahp <= 0:
            print("Yes")
            break
    else:
        thp -= aatk
        turn += 1
        if thp <= 0:
            print("No")
            break

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

flg = 0

for i in range(101):
    c = c - b
    if c <= 0:
        flg = 0
        break
    
    a = a - d
    if a <= 0:
        flg = 1
        break

if flg == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
A, B, C, D = map(int, input().split())
count = 0
while True:
    if count % 2 == 0: 
        C -= B
    else: 
        A -= D
    if C <= 0:
        ret = 'Yes'
        break
    if A <= 0:
        ret = 'No'
        break
    count += 1
print(ret)

Solution (Python):
import math

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

Solution (Python):
import sys

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

while a>0 and c>0:

    c -=b
    if c<=0:
        break
    a -=d

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

Solution (Python):
ht,st,ha,sa=map(int,input().split())
while(ht>0 and ha>0):
    ha-=st
    if ha<=0:
        print("Yes")
        break
    ht-=sa
    if ht<=0:
        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())
turn_t = c//b
if c %  b!= 0:
    turn_t += 1
turn_a = a//d 
if a % d != 0:
    turn_a += 1
if turn_a >= turn_t:
    print('Yes')
else:
    print('No')

Solution (Python):
line = input().split(" ")

hp_t = int(line[0])
at_t = int(line[1])
hp_a = int(line[2])
at_a = int(line[3])

hp_now_t = hp_t
hp_now_a = hp_a

while(1):
  hp_now_a = hp_now_a - at_t
  if hp_now_a <= 0:
    print("Yes")
    break
  hp_now_t = hp_now_t - at_a
  if hp_now_t<= 0:
    print("No")
    break

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

while A > 0:
  C = C-B
  if C <= 0:
    print("Yes")
    quit()
  else:
    A = A-D
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

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())
while not (a<=0 or c<=0):
    c -= b
    if c <= 0:
        break
    else:
        a -= d
if a <= 0:
    print('No')
else:
    print('Yes')

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

takahashi_iter = 0
while 1:
  tmp[2] -= tmp[1]
  takahashi_iter += 1
  if tmp[2] <= 0:
    break
  
aoki_iter = 0
while 1:
  tmp[0] -= tmp[3]
  aoki_iter += 1
  if tmp[0] <= 0:
    break
    
if takahashi_iter <= aoki_iter:
  print("Yes")
else:
  print("No")

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

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

print(ans)

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

Solution (Python):
h1,s1,h2,s2 = map(int, input().split())

while h1 -s2>0 or h2-s1>0:
    h2 -= s1
    h1 -= s2
print('Yes' if h1>0 else 'No')

Solution (Python):
a, b, c, d = map(int, input().split())
flg1 = False
flg2 = False
while True:
    c -= b
    a -= d
    if c <= 0:
        flg1 = True
    if a <= 0:
        flg2 = True

    if flg1:
        print("Yes")
        exit()
    if flg2:
        print("No")
        exit()

Solution (Python):
"""
import random
import functools
import copy
import bisect
import array
import re
import collections
import heapq
import fractions
import itertools
import string
import math
from operator import itemgetter as ig
from bisect import bisect_left, bisect_right, insort_left, insort_right
from itertools import permutations, combinations, product, accumulate, groupby
from heapq import heappush, heappop
from collections import deque, defaultdict, Counter
import sys
sys.setrecursionlimit(10 ** 7)


inf = 10 ** 20
INF = float("INF")
mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = dd + [(-1, 1), (1, 1), (1, -1), (-1, -1)]
ddn9 = ddn + [(0, 0)]
'''for dx, dy in dd:
        nx = j + dx; ny = i + dy
            if 0 <= nx < w and 0 <= ny < h:'''
"""
from collections import deque, defaultdict, Counter
import math
import sys
sys.setrecursionlimit(10 ** 7)


def wi(): return list(map(int, sys.stdin.readline().split()))



def wip(): return [int(x) - 1 for x in sys.stdin.readline().split()]


def ws(): return sys.stdin.readline().split()


def si(): return int(sys.stdin.readline())  


def ss(): return input()


def hi(n): return [si() for _ in range(n)]


def hs(n): return [ss() for _ in range(n)]  


def s_list(): return list(input())


def mi(n): return [wi() for _ in range(n)]  


def mip(n): return [wip() for _ in range(n)]


def ms(n): return [ws() for _ in range(n)]


def num_grid(n): return [[int(i) for i in sys.stdin.readline().split()[
    0]] for _ in range(n)]  


def grid(n): return [s_list() for _ in range(n)]


def gcd(a, b):
    while b:
        a, b = b, a % b
    return a




def round_up(a, b):
    """ a/b の切り上げ """
    c = (a + b - 1) / b
    return c


def lcm(a, b):
    """a,bの最小公倍数"""
    return a * b // gcd(a, b)


def main():
    a, b, c, d = wi()
    for i in range(10000):
        c -= b
        if c <= 0:
            print('Yes')
            sys.exit()
        a -= d
        if a <= 0:
            print('No')
            sys.exit()


if __name__ == '__main__':
    main()

Solution (Python):


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

while True:
    c -= b
    a -= d

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

Solution (Python):
import math


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

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

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


if __name__ == '__main__':
    solve()

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

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

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

Solution (Python):
import math
A, B, C, D = map(int, input().split())
Ta = A / D
Ao = C / B

print("No") if (math.ceil(Ta)<math.ceil(Ao)) else print("Yes")

Solution (Python):
A,B,C,D= list(map(int, input().split()))
i = 0
k = 0
while A > 0 and C > 0:
    C -= B
    i += 1
    if C <= 0:
        break
    A -= D
    k += 1

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

Solution (Python):
a,b,c,d=list(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):


import sys
readline = sys.stdin.readline
read = sys.stdin.read

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

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

Solution (Python):
HP_1,PW_1,HP_2,PW_2=map(int,input().split())

turn = 0

while 0 < HP_1 and 0 < HP_2:
	if turn % 2 == 0:
		HP_2 -= PW_1
	else:
		HP_1 -= PW_2
	turn += 1

if HP_2 <= 0:
	ans = "Yes"
else:
	ans = "No"

print(ans)

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

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

ans = 'Yes'

end = False
while not end:
  c -= b
  if c <= 0:
    end = True
  if end != True:
    a -= d
    if a <= 0:
      ans = 'No'
      end = True
  

print(ans)

Solution (Python):

"""
Created on Sun Apr 26 20:57:33 2020
"""

import sys


sys.setrecursionlimit(10 ** 9)


mod = 10**9+7


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


counta = 0
ans = 0
while a > 0 and c > 0:
    if counta % 2 == 0:
        c -= b
        ans = 'Yes'
    else:
        a -= d
        ans = 'No'
    counta += 1


print(ans)

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

N=-(-c//b)
M=-(-a//d)

if N<=M:
  print("Yes")
else:
  print("No")

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

if C%B == 0:
    X = C//B - 1
else:
    X = C//B
if A%D == 0:
    Y = A//D -1
else:
    Y = A//D

if Y>=X:
    print('Yes')
else:
    print('No')

Solution (Python):
import math
i = list(map(int, input().split()))
a=math.ceil(i[0]/i[3])
b=math.ceil(i[2]/i[1])
if a<b:
    print('No')
else:
    print('Yes')

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

def calc_attacks(HP, AT):
    q, mod = divmod(HP, AT)
    if mod != 0:
        q += 1
    return q
tkh = calc_attacks(A, D)
aok = calc_attacks(C, B)
if tkh >= aok:
    print('Yes')
else:
    print('No')

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

t = math.ceil(c/b) - 1

if d*t >= a:
    print("No")
else:
    print("Yes")

Solution (Python):
[A, B, C, D] = input().split(' ')
A = int(A)  
B = int(B)  
C = int(C)  
D = int(D)  

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

    if turn == 0:
        C = C - B
        turn = 1
    else:
        A = A - D
        turn = 0

Solution (Python):

a, b, c, d = input().split(' ')
hp_takahashi = int(a)
at_takahashi = int(b)
hp_aoki = int(c)
at_aoki = int(d)

while hp_takahashi > 0 and hp_aoki > 0:
    hp_aoki -= at_takahashi
    if hp_aoki <= 0:
        print('Yes')
        break
    hp_takahashi -= at_aoki
    if hp_takahashi <= 0:
        print('No')
        break

Solution (Python):
A, B, C, D = list(map(int, input().split()))
t = True
while A>0 or C>0:
    C-=B
    if C<=0:
        break
    A-=D
    if A<=0:
        t = False
        
if t:
    print('Yes')
else:
    print('No')

Solution (Python):
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
        if A <= 0:
            print('No')
            sys.exit()

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

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

Solution (Python):
from math import ceil


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

print("Yes" if ceil(c / b) <= ceil(a / d) 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):
tkhs,b,aok,d = map(int, input().split())


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

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

hp = l[0]
attack = l[1]
hp2= l[2]
attack2 = l[3]

while 1 == 1:
    hp2 -= attack
    if hp2 <= 0:
        print("Yes")
        break
    hp -= attack2
    if hp <= 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 all:
    c -= b
    if(c <= 0):
        print("Yes")
        break
    a -= d
    if(a <= 0):
        print("No")
        break

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):
import math
a = list(map(int,input().split()))
b = math.ceil(a[2]/a[1])
c = math.ceil(a[0]/a[3])
if b<=c:
    print('Yes')
else:
    print('No')

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

for i in range(999999):
    C -= B
    if C <= 0:
        print('Yes')
        break
    A -= D
    if A <= 0:
        print('No')
        break

Solution (Python):

import sys

input = sys.stdin.buffer.readline


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

def solve(a, b, c, d):

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

        

    return a > 0

ans = solve(a, b, c, d)

if ans:
    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:
    a -= d
  else:
    break

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

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

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

i = 0

while A > 0 or C > 0:
    if i % 2 == 0:
        C = C - B
    else:
        A = A - D

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

    i+=1

Solution (Python):
thp, tat, ahp, aat = map(int, input().split())

while True:
    ahp = ahp - tat
    thp = thp - aat
    if ahp <= 0:
        print("Yes")
        break
    elif thp <= 0:
        print("No")
        break
    else:
        continue

Solution (Python):
def retm(a,b):
  if a%b>0:
    return 1
  else:
    return 0

th,ta,ah,aa=map(int,input().split())
if int(ah/ta)+retm(ah,ta)<=int(th/aa)+retm(th,aa):
  print("Yes")
else:
  print("No")

Solution (Python):
A, B, C, D = map(int, input().split())
while B >= 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())
taka = (A - 1) // D + 1
aoki = (C - 1)  // B + 1

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

Solution (Python):
A,B,C,D = map(int,input().split(' '))
count1 = 0
while A > 0:
    A -= D
    count1 += 1
count2 = 0
while C > 0:
    C -= B
    count２ += 1 
if count1>count2:
    
    print('Yes')
elif count1<count2:
    print("No")
elif count1 == count2:
    print("Yes")

Solution (Python):
A,B,C,D=map(int, input().split())
taka=0
ao=0
if C%B==0:
    taka=C//B
else:
    taka=C//B+1
if A%D==0:
    ao=A//D
else:
    ao=A//D+1

if taka<=ao:
    print('Yes')
else:
    print('No')

Solution (Python):
a = list(map(int,input().split()))
takahashi=-(-a[0] // a[3])
aoki=-(-a[2] // a[1])
if(takahashi>=aoki):
    print("Yes")
else:
    print("No")

Solution (Python):
t_hp, t_at, a_hp, a_at = map(int,input().split())

while True:
    a_hp -= t_at
    if 0 >= a_hp:
        print('Yes')
        break
    t_hp -= a_at
    if 0 >= t_hp:
        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("No")
else:
    print('Yes')

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

tk_count = -(-c // b)
ao_count = -(-a // d)

if tk_count <= ao_count:
    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())
flag = True

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

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

Solution (Python):
A,B,C,D=map(int,input().split())
for i in range(100):
  C=C-B
  if C<=0:
    print("Yes")
    break
    
  A=A-D
  if A<=0:
    print("No")
    break

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

while(1):
    inp[2] -= inp[1]
    if inp[2] <= 0:
        print('Yes')
        break
    inp[0] -= inp[3]
    if inp[0] <= 0:
        print('No')
        break

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

while True:
    c -= b
    if c <= 0:
        break
    a -= d
    if a <= 0:
        break

ans = 'Yes'
if a <= 0:
    ans = 'No'

print(ans)

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

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

Solution (Python):
import math

a, b, c, d = map(int, input().split())
t_hit = math.ceil(c / b)
a_hit = math.ceil(a / d)

if t_hit <= a_hit:
    print("Yes")
else:
    print("No")

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

for i in range(1001):
    if i % 2 == 0:
        c -= b
        if c <= 0:
            print("Yes")
            break
    elif i % 2 == 1:
        a -= d
        if a <= 0:
            print("No")
            break

Solution (Python):
a,b,c,d=list(map(int,input().split()))
n=10**100
for i in range(n):
    if c-i*b<=0:
        print("Yes")
        break
    elif a-i*d<=0:
        print("No")
        break

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

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

print('Yes' if flag==0 else 'No')

Solution (Python):


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

A=int(A)
B=int(B)
C=int(C)
D=int(D)

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

print(ans)

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

if a % 1 != 0: a = int(a) + 1
if b % 1 != 0: b = int(b) + 1

if a > b:
    print("No")
else:
    print("Yes")

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

def func(X,Y):
    if X%Y == 0:
        return X//Y
    else:
        return (X//Y)+1
    
if func(C,B) <= func(A,D):
    print('Yes')
else:
    print('No')

Solution (Python):
import math

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

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


if tak <= aok:
    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()))
a = C - B
t = A - D
while t > 0 and a > 0:
    a -=  B
    t -= D
if a <= 0:
    print('Yes')
else:
    print("No")

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

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

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

import math

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

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


def main():
    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")


if __name__ == "__main__":
    main()

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

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

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

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

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

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

while a > 0 and c > 0:
    if phase_change == True:
        c -= b
        phase_change = False
    else:
        a -= d
        phase_change = True

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

Solution (Python):
n,nm,m,mm = map(int,input().split())

while True:
    m -= nm
    if m<=0:
        print("Yes")
        break
    n -= mm
    if n<=0:
        print("No")
        break

Solution (Python):
a,b,c,d=map(int,input().split())
if a%d!=0:
    td=(a//d)+1
else:
    td=a//d
if c%b!=0:
    md=(c//b)+1
else:
    md=(c//d)
if td<md:
    print('No')
else:
    print('Yes')

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

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

Solution (Python):
tt, te, at, ae = input().split(" ")
tt = int(tt)
te = int(te)
at = int(at)
ae = int(ae)

win = ""
while True:
    at -= te
    if at <= 0:
        win = "t"
        break
    tt -= ae
    if tt <= 0:
        win = "a"
        break

if win == "t":
    print("Yes")
else:
    print("No")

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

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

T_time = C // B
if not C % B == 0 :
  T_time += 1

A_time = A // D
if not A % D == 0 :
  A_time += 1

if T_time <= A_time :
  print("Yes")
else :
  print("No")

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

takahasi_hp = A
aoki_hp = C

while(True):
    aoki_hp = aoki_hp - B
    if( aoki_hp <= 0):
        print("Yes")
        break

    takahasi_hp = takahasi_hp - D
    if( takahasi_hp <= 0):
        print("No")
        break

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

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

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

Solution (Python):
a_h, a_a, b_h, b_a = map(int, input().split())

while(True):
  b_h-=a_a
  if b_h<=0:
    print('Yes')
    break
  a_h-=b_a
  if a_h<=0:
    print('No')
    break

Solution (Python):
inputs = input().split(' ')

taka_hp = int(inputs[0])
taka_at = int(inputs[1])
aoki_hp = int(inputs[2])
aoki_at = int(inputs[3])

while True:
  aoki_hp -= taka_at
  if aoki_hp <= 0:
    print('Yes')
    break
  taka_hp -= aoki_at
  if taka_hp <= 0:
    print('No')
    break

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

taka = 0
hashi = 0

if B*(C//B)==C:
    taka = C//B
else:
    taka = C//B +1
    
if D*(A//D)==A:
    hashi = A//D
else:
    hashi = A//D +1

if taka <= hashi:
    print("Yes")
else:
    print("No")

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

tak_hp = a
aok_hp = c

while tak_hp > 0 and aok_hp > 0:
    aok_hp = aok_hp - b
    if not aok_hp > 0:
        print('Yes')
    else:
        tak_hp = tak_hp - d
        if not tak_hp > 0:
            print('No')

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

e = a//d
f = c//b
while a>0 and c>0:
	c-=b
	if c<=0:
		print("Yes")
		break
	a-=d
	if a<=0:
		print("No")

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

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

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

for i in range(1000):
  if i == 0:
    AOKI = C - B
    if AOKI <= 0:
      print('Yes')
      break
    TAKAHASHI = A - D
    if TAKAHASHI <= 0:
      print('No')
      break

  AOKI = AOKI - B
  if AOKI <= 0:
      print('Yes')
      break

  TAKAHASHI = TAKAHASHI - D
  if TAKAHASHI <= 0:
    print('No')
    break

Solution (Python):


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

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

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

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

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