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 re
import math
from collections import defaultdict
import itertools
from copy import deepcopy
import random
from heapq import heappop,heappush
import time
import os
import queue
import sys
import datetime
from functools import lru_cache
readline=sys.stdin.readline
sys.setrecursionlimit(2000)

alphabet="abcdefghijklmnopqrstuvwxyz"
mod=int(10**9+7)
inf=int(10**20)
def yn(b):
    if b:
        print("yes")
    else:
        print("no")
def Yn(b):
    if b:
        print("Yes")
    else:
        print("No")
def YN(b):
    if b:
        print("YES")
    else:
        print("NO")
class union_find():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(N)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def is_power(a,b):
    now=b
    while now<a:
        now*=b
    if now==a:return True
    else:return False
def bin_(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def get_facs(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def next_comb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:
        return num
def get_primes(n,type="int"):
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    if(type=="bool"):return A
    B=[]
    for a in range(n+1):
        if(A[a]):B.append(a)
    return B
def is_prime(num):
    if(num<=2):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def ifelse(a,b,c):
    if a:return b
    else:return  c
def join(A,c=" "):
    n=len(A)
    A=list(map(str,A))
    s=""
    for a in range(n):
        s+=A[a]
        if(a<n-1):s+=c
    return s
def factorize(n,type_="dict"):
    b = 2
    list_ = []
    while b * b <= n:
        while n % b == 0:
            n //= b
            list_.append(b)
        b+=1
    if n > 1:list_.append(n)
    if type_=="dict":
        dic={}
        for a in list_:
            if a in dic:
                dic[a]+=1
            else:
                dic[a]=1
        return dic
    elif type_=="list":
        return list_
    else:
        return None
def floor_(n,x=1):
    return x*(n//x)
def ceil_(n,x=1):
    return x*((n+x-1)//x)
def hani(x,min_,max_):
    ret=x
    if x<min_:ret=min_
    if x>max_:ret=max_
    return ret
def seifu(x):
    return x//abs(x)


def main():
    A,B,C,D=map(int,input().split())
    for a in range(10000):
        if a%2==0:
            C-=B
            if C<=0:
                print("Yes")
                break
        else:
            A-=D
            if A<=0:
                print("No")
                break
        
main()

Solution (Python):
hp1, at1, hp2, at2 = map(int, input().split())

while True:
    hp2 -= at1
    if hp2 <= 0:
        print('Yes')
        break

    hp1 -= at2
    if hp1 <= 0:
        print('No')
        break

Solution (Python):

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

if __name__ == '__main__':
    main()

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


def cal(x,y):
    return x//y + (x%y!=0)

if cal(c,b) <= cal(a,d):
    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 c <= 0:
    print("Yes")
else:
    print("No")

Solution (Python):
def main():
    a,b,c,d = (int(x) for x in input().split())
    i = 1
    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')

if __name__ == '__main__':
    main()

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

Solution (Python):
A, B, C, D = map(lambda x: int(x), 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())

for i in range(100000):
    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())

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

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

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

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

Solution (Python):
A, B, C, D = [int(n) for n in input().split()]
S = C // B
if C % B != 0:
    S += 1

T = A // D
if A % D != 0:
    T += 1

if T >= S:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque

from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush


def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]



a,b,c,d=MI()
for i in range(1000):
    c-=b
    a-=d
    if c<=0:
        print("Yes")
        sys.exit()
    elif a<=0:
        print("No")
        sys.exit()

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

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

countT = math.ceil(C/B)
countA = math.ceil(A/D)

if countT <= countA:
  print("Yes")
else:
  print("No")

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

flag = True
while (A > 0) & (C > 0):
    if flag:
        C -= B
        flag = False
    else:
        A -= D
        flag = True

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

Solution (Python):
import sys
import heapq
from collections import deque


INF = sys.maxsize



def main():
    a_hp,a_atc,b_hp,b_atc = map(int, input().split())

    while True:
        b_hp -= a_atc

        if b_hp<1:
            print("Yes")
            exit(0)

        a_hp -= b_atc
        if a_hp<1:
            print("No")
            exit(0)

if __name__ == '__main__':
    main()

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

while True:
    ABCD[2] = ABCD[2] - ABCD[1]
    if ABCD[2] <= 0:
        print("Yes")
        break

    ABCD[0] = ABCD[0] - ABCD[3]
    if ABCD[0] <= 0:
        print("No")
        break

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

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

a = (A + (D-1))//D
c = (C + (B-1))//B

print('Yes'if a >= c else 'No')

Solution (Python):
def input_one_number():
    return int(input())

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

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


A,B,C,D = input_multiple_number()

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=[int(x) for x in input().split()]

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

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

if turn % 2 == 0:
    print("No")
else:
    print("Yes")

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

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

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

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

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

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

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

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



'''
A=[]
B=[]
for i in range():
    a, b = map(int, input().split())
    A.append(a)
    B.append(b)'''

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

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

Solution (Python):
takaH, takaA, aokiH, aokiA = map(int, input().split())

while True:
    aokiH -= takaA
    if aokiH <= 0: break
    takaH -= aokiA
    if takaH <= 0: break
if takaH <= 0:
    print('No')
else:
    print('Yes')

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











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

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

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

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

i = 0
while True:
    if a <= 0:
        print('No')
        exit()
    elif c <= 0:
        print('Yes')
        exit()
    if i % 2 == 0:
        c -= b
    else:
        a -= d
    i += 1

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

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

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

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

Solution (Python):
import sys

a, b, c, d = map(int, sys.stdin.readline().split())

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__':
    main(a, b, c, d)

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

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

from decimal import *
from itertools import permutations, combinations,combinations_with_replacement,product
import math


s = input().split()
p = [int(w) for w in s] 


A = p[0]
B = p[1]
C = p[2]
D = p[3]

mode = 'Tattack'
while (A>0 and C>0):
    if(mode == 'Tattack'):
        C = C-B
        mode = 'Aattack'
    else:
        A = A-D 
        mode = 'Tattack'

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

a = A // D
c = C // B

if A % D != 0:
    a += 1
if C % B != 0:
    c += 1

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

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

i = 0

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

    i += 1

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

if c <= 0:
    print('Yes')

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

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

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

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

Solution (Python):


import sys

DEBUG = False

def read(t):
    return t(sys.stdin.readline().rstrip())


def read_list(t, sep = " "):
    return [t(s) for s in sys.stdin.readline().rstrip().split(sep)]


def dprint(*args, **kwargs):
    if DEBUG:
        print(*args, **kwargs)
    return


def main():
    a, b, c, d = read_list(int)
    while True:
        c -= b
        if c <= 0:
            print("Yes")
            break
        a -= d
        if a <= 0:
            print("No")
            break


if __name__ == "__main__":
    main()

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

while True:
    A = A-D
    C = C-B
    if C <= 0:
        print('Yes')
        break
    elif 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):
t_HP,t_AT,a_HP,a_AT=map(int,input().split())
while 1:
    a_HP-=t_AT

    if a_HP<=0:
        print("Yes")
        exit()

    t_HP-=a_AT
    
    if t_HP<=0:
        print("No")
        exit()

Solution (Python):
import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd 
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) 


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

Solution (Python):
a,b,c,d=map(int,input().split())
for i in range(1000):
  if i%2==0:
    c-=b
  else:
    a-=d
  if a<=0 or c<=0:
    break
if a<=0:
  print('No')
else:
  print('Yes')

Solution (Python):
import sys
sys.setrecursionlimit(10000000)


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())
t = 0

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

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

Solution (Python):


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


if __name__ == '__main__':
    main()

Solution (Python):
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): 
    return list(map(int,input().split()))
def m(): 
    return map(int,input().split())
def onem(): 
    return int(input())
def s(x): 
    a = []
    if len(x) == 0:
        return []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): 
    return " ".join(map(str,x))
def max2(x): 
    return max(map(max,x))
def In(x,a): 
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def pow_k(x, n):
    ans = 1
    while n:
        if n % 2:
            ans *= x
        x *= x
        n >>= 1
    return ans

"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

a,b,c,d = m()

aa = -(-c//b)
cc = -(-a//d)
if aa <= cc:
    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):
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):
a, b, c, d = map(int, input().split())
ta = (c + b - 1) // b
ao = (a + d - 1) // d

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

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

takahashi = math.ceil(a/d)
aoki = math.ceil(c/b)

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

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
INF = 10**10
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 = [int(e) for e 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 = list(map(int, input().split()))
a = A
c = C
is_t = True
while True:
    c -= B
    if c <= 0:
        break
    a -= D
    if a <= 0:
        is_t = False
        break
ans = "Yes" if is_t else "No"
print(ans)

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

while True:
    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())
turn = 0
while True:
    if not turn:
        c-=b
        turn = 1
    else:
        a-=d
        turn = 0
    if c <= 0:
        flag = 1
        break
    if a <= 0:
        flag = 0
        break
if flag:
    print("Yes")
else:
    print("No")

Solution (Python):






import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr


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





B,A,D,C= inputIL()

a = (D+(A-1))//A
c = (B+(C-1))//C

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

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):
from math import ceil
A, B, C, D = map(int, input().split())
a = ceil(A/ D)
b = ceil(C/ B)
if b > a:
    print('No')
else:
    print('Yes')

Solution (Python):

a, b, c, d = map(int, input().split())
for i in range(210):
    if i % 2 == 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())

turn=0
while(a>0 and c>0):

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

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

Solution (Python):
A,B,C,D = [int(i) for i in 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 math
a, b, c, d = map(int, input().split())
print('Yes' if math.ceil(c/b) <= math.ceil(a/d) else 'No')

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

Solution (Python):


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

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

t=0
while 1:
    if t==0:
        c-=b
        t=1
        if c<=0:
            print("Yes")
            exit()
    else:
        a-=d
        t=0
        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):
input = raw_input

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

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

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

if r1 == r2:
    out = "Yes"
elif r1 > r2:
    out = "Yes"
else:
    out = "No"

print(out)

Solution (Python):


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

T = -(-A // D)
AO = -(-C // B)

if T >= AO :
    print('Yes')
else :
    print('No')

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

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

for i in range(1000) :
    c -= b
    if c <= 0 :
        print('Yes')
        break
    a -= d
    if a <= 0 :
        print('No')
        break

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


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

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())
for i in range(1000):
    c-=b
    if c<=0:
        print("Yes")
        exit()
    a-=d
    if a<=0:
        print("No")
        exit()

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

    while True:
        c -= b
        if c <= 0:
            print('Yes')
            return
        a -= d
        if a <= 0:
            print('No')
            return
if __name__=='__main__':
    main()

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 True:
    if A <= 0 or C <= 0:
        break
    C -= B
    A -= D
print('Yes' if C<=0 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())
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())
for k in range(200):
    C-=B
    if C<=0:
        print("Yes")
        break
    A-=D
    if A<=0:
        print("No")
        break

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

if c % b != 0:
    turn1 = (c // b) + 1
else:
    turn1 = (c // b)
if a % d != 0:
    turn2 = (a // d) + 1
else:
    turn2 = (a // d)
    
if turn1 <= turn2:
    print('Yes')
else:
    print('No')

Solution (Python):



 
import sys
import math



 

fileoperation=0
if(fileoperation):
    orig_stdout = sys.stdout
    orig_stdin = sys.stdin
    inputfile = open('W:/Competitive Programming/input.txt', 'r')
    outputfile = open('W:/Competitive Programming/output.txt', 'w')
    sys.stdin = inputfile
    sys.stdout = outputfile


mod=1000000007
 

def nospace(l):
    ans=''.join(str(i) for i in l)
    return ans
 
 
 

t=1
for tt in range(t):
    
    a,b,c,d= map(int, sys.stdin.readline().split(' '))
    f=1
    while(1):
        if(f):
            c-=b
            if(c<=0):
                break
        else:
            a-=d
            if(a<=0):
                break
        f=f^1
    if(a<=0):
        print("No")
    else:
        print("Yes")
    
    
    

if(fileoperation):
    sys.stdout = orig_stdout
    sys.stdin = orig_stdin
    inputfile.close()
    outputfile.close()

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

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

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