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


from queue import Queue
from queue import LifoQueue as Stack
from math import sqrt, floor, ceil, log2, log10, pi
from fractions import gcd
from itertools import permutations, combinations
from operator import itemgetter
from functools import cmp_to_key


INF=1001001001
__MOD__=(10**9)+7
yn = 'YNeos'
judge = False
cnt = 0
ans = None


def lcm(a, b):
    return (a*b) // gcd(a,b)

def intinput():
    return int(input())

def mulinputs():
    return map(int,input().split())

def lineinputs(func=intinput):
    datas = []
    while True:
        try:
            datas.append(func())
        except EOFError:
            break
    return datas

class ModInt():
    def __init__(self, x):
        self.__x = (x % __MOD__)
    def __add__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x + other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x + other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __radd__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((other.__x + self.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((other.__x + self.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")

    def __sub__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x - other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x - other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __rsub__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((other.__x - self.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((other.__x - self.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")

    def __mul__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x * other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x * other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __rmul__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((other.__x * self.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((other.__x * self.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")

    def __truediv__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x * other.__modinv())%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x * other.__modinv())%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __rtruediv__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((other.__x * self.__modinv())%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((other.__x * self.__modinv())%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")

    def __pow__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__(pow(self.__x, other.__x, __MOD__)))
        elif type(other) == ModInt:
            return self.__class__(pow(self.__x, other.__x, __MOD__))
        else:
            raise Exception("Not Int or Not ModInt")
    def __rpow__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__(pow(other.__x, self.__x, __MOD__)))
        elif type(other) == ModInt:
            return self.__class__(pow(other.__x, self.__x, __MOD__))
        else:
            raise Exception("Not Int or Not ModInt")

    def __modinv(self, m=__MOD__):
        a = self.__x
        if a == 0:
            raise ZeroDivisionError()
        if gcd(a, m) != 1:
            raise Exception("%sの逆数は求まりません。" % a)
        b, u, v = m, 1, 0
        while b != 0:
            t = a//b;
            a -= t*b
            a, b = b, a
            u -= t * v
            u, v = v, u
        u %= m
        if u < 0:
            u += m
        return u
    def __int__(self):
        return self.__x
    def __str__(self):
        return str(self.__x)



if __name__ == '__main__':
    A, B, C, D = mulinputs()

    
    for _ in range(100):
        if B >= C:
            print('Yes')
            exit()
        else:
            C -= B
        if D >= A:
            print('No')
            exit()
        else:
            A -= D

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 calc(A,B,C,D):
    while A > 0 and C > 0:
        C = C - B
        if C <= 0:
            return 'Yes'
        A = A - D
        if A <= 0:
            return 'No'

(A,B,C,D) = tuple([int(s) for s in input().split()])
print(calc(A,B,C,D))

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 True:
    if i % 2 == 0:
        c -= b
    else:
        a -= d
    i += 1

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

Solution (Python):
def main(a, b, c, d):
    while True:
        c -= b
        if c <= 0:
            print("Yes")
            return

        a -= d
        if a <= 0:
            print("No")
            return


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

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


if __name__ == '__main__':
    resolve()

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

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

Solution (Python):
A, B, C, D = map(int, input().split())
tt = C // B + 1
ta = A // D + 1
if C % B == 0:
    tt -= 1
if A % D == 0:
    ta -= 1

print('Yes' if tt <= ta else '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):
hp, atk, e_hp, e_atk = map(int, input().split())

count = 1
while hp > 0 and e_hp > 0 :
  if count % 2 == 1:
    e_hp -= atk 
  else:
    hp -= e_atk
  count += 1

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

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

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

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

ta = c//b if c % b == 0 else c//b + 1
aa = a//d if a % d == 0 else a//d + 1

print('No' if ta > aa else 'Yes')

Solution (Python):
a,b,c,d=map(int,input().split())
for i in range(100):
    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-=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())

def solve(a,b,c,d):
    while True:
        c -= b
        if c <= 0:
            return "Yes"
        a -= d
        if a <= 0:
            return "No"

print(solve(a,b,c,d))

Solution (Python):
def main():
    import sys
    sys.setrecursionlimit(10 ** 6)
    input = sys.stdin.readline
    A, B, C, D = [int(x) for x in input().strip().split()]
    t = 0
    while A > 0 and B > 0:
        if t == 0:
            C -= B
        else:
            A -= D
        if A <= 0:
            print('No')
            exit()
        elif C <= 0:
            print('Yes')
            exit()
        t ^= 1


if __name__ == '__main__':
    main()

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):
import math
THP,TA,AHP,AA = map(int,input().split())
T = math.ceil(AHP/TA)
A = math.ceil(THP/AA)
print("YNeos"[T > A ::2])

Solution (Python):
a,b,c,d = map(int, input().split())
for i in range(1000):
    c -= b
    if c <= 0:
        print("Yes")
        exit()
    a -= d
    if a <= 0:
        print("No")
        exit()

Solution (Python):
import sys

sys.setrecursionlimit(10**6)
readline = sys.stdin.readline

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

    print(ans)


if __name__ == "__main__":
    main()

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

if __name__ == "__main__":
    main()

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


def solve(A: int, B: int, C: int, D: int):
    while True:
        C -= B
        if C <= 0:
            print("Yes")
            break
        A -= D
        if A <= 0:
            print("No")
            break
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  
    B = int(next(tokens))  
    C = int(next(tokens))  
    D = int(next(tokens))  
    solve(A, B, C, D)

if __name__ == '__main__':
    main()

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

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

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

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

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

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 sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7

a, b, c, d = MAP()

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

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

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

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

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

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


resolve()

Solution (Python):
import math

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

n = math.ceil(a / d)
m = math.ceil(c / b)

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

Solution (Python):
th, ta, ah, aa = map(int, input().split())

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

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

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

player= [[a,b],[c,d]]

turn = 0

while player[0][0] > 0 and player[1][0] > 0:
    opp = 1-turn
    player[opp][0] -= player[turn][1]
    turn = opp

if player[0][0] <= 0:
    print("No")
else:
    print("Yes")

Solution (Python):
import bisect
import collections
import sys

sys.setrecursionlimit(100000)
input = sys.stdin.readline
ACMOD = 1000000007
INF = 1 << 62


def lmi():
    return list(map(int, input().split()))


def llmi(n):
    return [lmi() for _ in range(n)]


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

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

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

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

Solution (Python):
a,b,c,d=map(int,input().split())
for _ in range(101):
    c=c-b
    if c<=0:
        print("Yes")
        break
    a=a-d
    if a<=0:
        print("No")
        break

Solution (Python):
import sys
import re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce


def input(): return sys.stdin.readline().strip()


def INT(): return int(input())


def MAP(): return map(int, input().split())


def LIST(): return list(map(int, input().split()))


def ZIP(n): return zip(*(MAP() for _ in range(n)))


sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7


def main():
    a, b, c, d = MAP()

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


if __name__ == '__main__':
    main()

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())
i=0
while A>0 and C>0:
  if i%2==0:
    C-=B
  else:
    A-=D
  i+=1
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 -= 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())
T = -(-c//b)
A = -(-a//d)
print(["Yes","No"][A<T])

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

kaisu = -(-A//D)

if B*kaisu >= C:
  print("Yes")
else:
  print("No")

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

Solution (Python):
T_HP, T_ATK, A_HP, A_ATK = map(int, input().split())

while True:
    A_HP -= T_ATK

    if A_HP <= 0:
        print('Yes')
        break

    T_HP -= A_ATK

    if T_HP <= 0:
        print('No')
        break

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

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

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

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

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
sl, sa, kl, ka = map(int, input().split())

winkaisu = math.ceil(kl/sa)
losekaisu = math.ceil(sl/ka)

if winkaisu <= losekaisu:
  print('Yes')
else:
  print('No')

Solution (Python):
import math

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

if s <= w:
  print('Yes')
else:
  print('No')

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

Solution (Python):

import math


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

print('Yes' if ta >= ao else 'No')

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

cnt = 0
while A>0 and C>0:
    if cnt%2==0:
        C-=B
        cnt+=1
    else:
        A-=D
        cnt+=1
if 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 A > 0 and B > 0:
    C -= B
    A -= D

if C <= 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())

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

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

Solution (Python):
def solve():
    h1 = a
    h2 = c
    while(1):
        h2 -= s1
        if h2<=0:
            print("Yes")
            exit()
        h1 -= s2
        if h1<=0:
            print("No")
            exit()



a, s1, c, s2 = [int(s) for s in input().split(" ")]
solve()

Solution (Python):
import math

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())
for i in range(1000):
    if i%2==0:
        c = c-b
        if c <=0:
            print('Yes')
            exit()
    else:
        a = 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 <1:
        print("Yes")
        break
    A = A-D
    if A <1:
        print("No")
        break

Solution (Python):
import sys
import re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B, C, D = MAP()

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

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

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

if Flag == True :
    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()))

x = int(c / b) + (c % b > 0)
y = int(a / d) + (a % d > 0) 

if x > y:
    print('No')
else:
    print('Yes')

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

Solution (Python):
import sys
import math
import queue
import copy
import bisect
from collections import deque 


def input(): return sys.stdin.readline()[:-1]
def printl(li): print(*li, sep="\n")
def argsort(s): return sorted(range(len(s)), key=lambda k: s[k])




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

















A,B,C,D = map(int,input().split())
e = (C-1) // B +1
f = (A-1) // D +1
if e <= f:
    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 = [int(i) for i in input().split()]

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

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

Solution (Python):
A, B, C, D = map(int, input().split())
is_taka = True
while A > 0 and C > 0:
    if is_taka:
        C -= B
    else:
        A -= D
    is_taka = not is_taka

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

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

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


import sys
import math
import time

import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq
import itertools








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

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

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

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

Solution (Python):
A, B, C, D = list(map(int, input().split()))
flag = True
while 0 < A and 0 < C:
  if flag:
    C -= B
  else:
    A -= D
  flag = not flag

if C <= 0:
  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())

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 = map(int, input().split())
t = True
while a > 0 and c > 0:
    if t:
        c = c - b
    else:
        a = a - d
    t = not t

if 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')
        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-=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())
aoki=c
taka=a
data=0
for i in range(10000):
    if i%2==0:
        aoki-=b
        if aoki<=0:
            data=i
            break
    else:
        taka-=d
        if taka<=0:
            data=i
            break
            
if data%2==0:
    print("Yes")
else:
    print("No")

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

cnt = 0
while a > 0 and c > 0:
    if cnt % 2 == 0:
        c -= b
    else:
        a -= d
    cnt += 1
if a <= 0: print("No")
else: print("Yes")

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

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):
import sys
from collections import deque
def input(): return sys.stdin.readline().strip()


def main():
    a, b, c, d = map(int, input().split())
    p = a // d
    q = c // b
    if a % d != 0:
        p += 1
    if c % b != 0:
        q += 1
    
    if p >= q:
        print("Yes")
    elif p < q:
        print("No")
    
    

if __name__ == "__main__":
    main()

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

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 sys
L = [el for el in map(int,input().split())]
A = L[0]
B = L[1]
C = L[2]
D = L[3]
while True:
    C-=B
    if C <= 0:
        print('Yes')
        sys.exit(0)
    A-=D
    if A <= 0:
        print('No')
        sys.exit(0)

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")
        exit()
    elif(A <= 0):
        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):
a,b,c,d = [int(x) for x in input().split()]
import math
x = math.ceil(c/b)
y = math.ceil(a/d)
if x>y:
    print("No")
else:
    print("Yes")

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

Solution (Python):
def main():
    a,b,c,d = tuple([int(t)for t in input().split()])

    while a>0 and b>0:
        c-=b
        if c<=0:
            print("Yes")
            return
        a-=d
        if a<=0:
            print("No")
            return
    if a>0:
        print("Yes")
    else:
        print("No")
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= list(map(int, input().split()))
for i in range(10000):
    c-=b
    if c<=0:
        print("Yes")
        exit(0)
    a-=d
    if a<=0:
        print("No")
        exit(0)

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