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(int,input().split())

x=-(-C//B)
y=-(-A//D)

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

Solution (Python):
import sys

lines = 1
inp = list()

for _ in range(lines):
    inp.append(sys.stdin.readline().strip())


line = inp[0].split()

a = int(line[0])
b = int(line[1])
c = int(line[2])
d = int(line[3])

t_life = a
a_life = c

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

Solution (Python):
def resolve():
    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
    if TA > AA:
        print('No')
    else:
        print('Yes')

if __name__ == '__main__':
    resolve()

Solution (Python):
import math

stMap = map(int, input().split())
st = list(stMap)

if (math.ceil(st[0] / st[3]) >= math.ceil(st[2] / st[1])):
    print('Yes')
else:
    print('No')

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

result = ''
while True:
  C -= B

  if (C <= 0):
    result = 'Yes'
    break
  
  A -= D
  if (A <= 0):
    result = 'No'
    break

print(result)

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

Solution (Python):
n = input().split(" ")
a = int(n[0])
b = int(n[1])
c = int(n[2])
d = int(n[3])
for i in range(100):
    c += -b
    if c <= 0:
        print("Yes")
        break
    a += -d
    if a <= 0:
        print("No")
        break

Solution (Python):
import sys
import math
def i():return int(sys.stdin.readline().replace("\n",""))
def i2():return map(int,sys.stdin.readline().replace("\n","").split())
def s():return str(sys.stdin.readline().replace("\n",""))
def l():return list(sys.stdin.readline().replace("\n",""))
def intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def lx():return list(map(lambda x:int(x)*-1,sys.stdin.readline().replace("\n","").split()))
def t():return tuple(map(int,sys.stdin.readline().replace("\n","").split()))

if __name__ == "__main__":pass
a,b,c,d = i2()
a1 = a//d
a2 = c//b
if a%d != 0:a1 += 1
if c%b != 0:a2 += 1
print("Yes" if a1 >= a2 else "No")

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

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

Solution (Python):
from math import ceil
a,b,c,d=map(int,input().split())
if ceil(c/b) > ceil(a/d) :
	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)
count=0
while True:
    if count%2==0:
        c=c-b
    else:
        a=a-d
    if a<=0:
        print("No")
        break
    elif c <=0:
        print('Yes')
        break
    else:
        count+=1

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

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

count_ao = 0
for i in range(100):
    c = c - b
    count_ao += 1
    if c <= 0:
        break

if count_ta >= count_ao:
    print('Yes')
else:
    print('No')

Solution (Python):

import math
from sys import stdin


def get_result(data):
    A, B, C, D = data
    takahasi_q = math.ceil(float(A/D))
    aoiki_q = math.ceil(float(C/B))
    if takahasi_q == aoiki_q:
        return 'Yes'
    return 'Yes' if takahasi_q > aoiki_q else 'No'


if __name__ == '__main__':
    data = list(map(int, stdin.readline().rstrip().split(' ')))
    result = get_result(data)
    print(result)

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

hp_a = a
hp_c = c

turn = "T"

while hp_a > 0 and hp_c > 0:
  if turn == "T":
    hp_c -= b
    turn = "A"
  elif turn == "A":
    hp_a -= d
    turn = "T"

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

Solution (Python):
import math

input_str = input()

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

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

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

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

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 = 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):
from math import ceil


def main(A=None, B=None, C=None, D=None):
    if not A:
        A, B, C, D = map(int, input().split())
    t = ceil(A/D)
    a = ceil(C/B)
    if t >= a:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    
    
    main()

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

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):
E = list(map(int, input().split()))
A = E[0]
B = E[1]
C = E[2]
D = E[3]

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())
count1 = 0
count2 = 0
while c > 0:
    c -= b
    count1 += 1
while a > 0:
    a -= d
    count2 += 1
if count1 <= count2:
    print("Yes")
else:
    print("No")

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

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

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

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

Solution (Python):
from math import ceil

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

Solution (Python):
from sys import stdin

def main():

    input = stdin.readline

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

    A_turn = (C + B - 1) // B
    C_turn = (A + D - 1) // D

    if A_turn <= C_turn:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

Solution (Python):
import sys
A, B, C, D = (int(x) for x in input().split())
while 1:
    C = C - B
    A = A - D
    if C <= 0:
        print('Yes')
        sys.exit()
    else:
        if A <= 0:
            print('No')
            sys.exit()

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

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

Solution (Python):






import sys,bisect
sys.setrecursionlimit(15000)

A,B,C,D = map(int,sys.stdin.readline().split())

if (C+B-1)//B <= (A+D-1)//D:
    print("Yes")
    exit()
print("No")

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

b_count = a // d
if a % d != 0:
    b_count += 1

a_count = c // b
if c % b != 0:
    a_count += 1

if a_count <= b_count:
    print("Yes")
else:
    print("No")

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

Solution (Python):


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

t_count = 0
a_count = 0

while A > 0:
    A -= D
    t_count += 1

while C > 0:
    C -= B
    a_count += 1

if t_count >= a_count:
    print('Yes')
else:
    print('No')

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

while A>0:
    A=A-D
    count1+=1
while C>0:
    C=C-B
    count2+=1

if count1>=count2:
    print("Yes")
else:
    print("No")

Solution (Python):

from collections import deque
from operator import itemgetter
from bisect import bisect_left, bisect
import itertools
import sys
import math
sys.setrecursionlimit(10**6)
input = sys.stdin.readline


def main():
    a, b, c, d = map(int, input().split())
    flag = -1
    while (a > 0 and c > 0):
        if flag == -1:
            c -= b
        else:
            a -= d
        flag *= - 1
    if flag == 1:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

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


if A%D==0:
    tk=A//D
else:
    tk=A//D+1

if C%B==0:
    ao=C//B
else:
    ao=C//B+1

if tk>=ao:
    print("Yes")
else:
    print("No")

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

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

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

from sys import exit
while True:

    c=c-b
    a=a-d

    if c<=0:

        print("Yes")
        exit()
    elif a<=0:

        print("No")
        exit()
    else: pass

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

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

print(ans)

Solution (Python):
A, B, C, D = map(int, input().split())
counter = 1
while A > 0 and C > 0:
    if counter % 2 == 1:
        '''T 攻击'''
        C -= B
    elif counter % 2 == 0:
        A -= D
    counter += 1
if A <= 0:
    print('No')
else:
    print('Yes')

Solution (Python):
A,B,C,D=map(int,input().split())
import math
if math.ceil(C/B)>math.ceil(A/D):
  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):
TakaHP,TakaATK,AoHP,AoATK=list(map(int,input().split()))
Tcount=0
Acount=0
while TakaHP>0:
    Tcount+=1
    TakaHP-=AoATK
while AoHP>0:
    Acount+=1
    AoHP-=TakaATK
if Tcount>=Acount:
    print('Yes')
else:
    print('No')

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

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

e = c // b
if c % b != 0:
    e += 1

f = a // d
if a % d != 0:
    f += 1

if e <= f:
    print("Yes")

else:
    print("No")

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

Solution (Python):
import math

A, B, C, D = [int(k) for k in input().split(' ')]
takahashi_wins = True 
if math.ceil(A / D) < math.ceil(C / B):
  takahashi_wins = False 
  
print('Yes' if takahashi_wins else 'No')

Solution (Python):
a, b, c, d = map(float, input().split())
import math
if math.ceil(c/b) > math.ceil(a/d):
    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 c <= 0:
    print('Yes')
else:
    print('No')

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

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

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

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


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

Solution (Python):
a, b, c, d = map(int, input().split())
c1 = 0
c2 = 0
while a > 0:
    a -= d
    c1 += 1

while c > 0:
    c -= b
    c2 += 1

if c1 >= c2:
    print('Yes')
else:
    print("No")

Solution (Python):
def main():
    t, t_a, a, a_a = list(map(int, input().split()))
    while True:
        a = a - t_a
        if a <= 0:
            print('Yes')
            exit()
        t = t - a_a
        if t <= 0:
            print('No')
            exit()




if __name__ == '__main__':
    main()

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

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

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

Solution (Python):


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

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

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 factorial as fact
import math
import fractions
import sys
import itertools
import numpy as np
from collections import Counter
import datetime

def input1():
	return int(input())


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


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

def keta(N):
	return len(str(N))


def input_daytime(input_time):
	time,distance=input_time.split()
	t=time.split(":")
	se=str(t[-1]).split(".")
	dt1 = datetime.timedelta(hours=int(t[0]),minutes=int(t[1]),seconds=int(se[0]),milliseconds=int(se[1]))
	return dt1

def combinations(n,r):
	return list(itertools.combinations(n,r))

def all_sets(num_list):
	subsets=[]
	for i in range(2,len(num_list) + 1):
		for c in combinations(num_list, i):
			subsets.append(c) 
	return subsets


def ch(x1):
	cf=[]
	for i in range(2,math.sqrt(x1)+1):
		if x1 % i==0:
			cf.append(i)
	return cf

def CountOneRoots(x,y):
	
	return fact(x+y)/fact(x)/fact(y)


def factorization(n):
	tmp=n
	count=0
	for i in range(2,int(n**0.5)+2):
		if tmp%i==0:
			cnt=0
			while tmp%i==0:
				cnt+=1
				tmp//=i
			count+=1
	if tmp!=1:
		count+=1

	return count
			




a,b,c,d=input2()

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

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

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

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

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

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


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

Solution (Python):
import math


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



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

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

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

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

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())
state = "Yes"
while 1:
  C -= B
  if C <= 0:
    break
  A -= D
  if A <= 0:
    state = "No"
    break
print(state)

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

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

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

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

print(ans)

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

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

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

print(ans)

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

if A%D==0:
    A_attack=A/D
else:
    A_attack=A/D+1

if T_attack<=A_attack:
    print "Yes"
else:
    print "No"

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


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


if taka <= ao:
    print("Yes")
elif taka > ao:
    print("No")

Solution (Python):
import sys
input = sys.stdin.readline
def print_ans(A, B, C, D):
    """Test Case
    >>> print_ans(10, 9, 10, 10)
    No
    >>> print_ans(46, 4, 40, 5)
    Yes
    """
    while True:
        
        C = C - B
        if(C <= 0):
            print("Yes")
            break
        
        A = A - D
        if(A <= 0):
            print("No")
            break



if __name__ == '__main__':
    A, B, C, D = map(int, input().rstrip().split())
    print_ans(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())
if -(-A//D)>=-(-C//B):
    print('Yes')
else:
    print('No')

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

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


if C%B == 0:
    cntA = C//B
else:
    cntA = C//B + 1

if A%D == 0:
    cntC = A//D
else:
    cntC = A//D + 1

if cntA <= cntC:
    print('Yes')
else:
    print('No')

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

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

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


if(C<=0):
    ans = "Yes"

print(ans)

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

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

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

if -(-ah//ta) <= -(-th//aa):
    print("Yes")
else:
    print("No")

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

Solution (Python):
from collections import defaultdict
from collections import deque
from string import ascii_uppercase
import sys, bisect, math, heapq

stdin = sys.stdin
read_int = lambda : list(map(int,stdin.readline().split()))
read_str = lambda : stdin.readline().rstrip()

a, b, c, d = read_int()

def solve():
    ans = 'Yes'
    ta = c // b + min(c % b, 1)
    ao = a // d + min(a % d, 1)
    if ta > ao:
        ans = 'No'
    return ans

if __name__ == "__main__":
    print(solve())

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

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

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

Solution (Python):
import sys

inp=input().split(" ")
thp=int(inp[0])
tat=int(inp[1])
ahp=int(inp[2])
aat=int(inp[3])

for i in range(100):
  ahp-=tat
  if ahp<=0:
    print("Yes")
    sys.exit()
  thp-=aat
  if thp<=0:
    print("No")
    sys.exit()

Solution (Python):
a,b,x,y=list(map(int, input().split()))
ans=0

while ans==0:
	x=x-b
	if x<1:
		ans=1
	if ans==0:
		a=a-y
	if a<1:
		ans=1

if a<1:
	print('No')
else:
	print('Yes')

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

Solution (Python):
def resolve():
	a, b, c, d = map(int, input().split())
	ta = a // d
	ea = c // b
	if a % d:
		ta += 1
	if c % b:
		ea += 1

	if ta >= ea:
		print('Yes')
	else:
		print('No')
resolve()

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

counter = -1

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

if counter % 2 == 0:
    print('Yes')
else:
    print('No')

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

Solution (Python):
a,b,c,d=map(int,input().split())
x=a//d
y=c//b
if a%d==0:
  x-=1
if c%b==0:
  y-=1
if x>=y:
  print("Yes")
else:
  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 math

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):
from math import ceil 

def inp(): return int(input()) 
def inpm(): return map(int,input().split()) 
def inpl(): return list(map(int, input().split())) 
def inpls(): return list(input().split()) 


A, B, C, D = inpl()

print("Yes") if ceil(float(A)/D)>=ceil(float(C)/B) else print("No")

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

Solution (Python):

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

if C%B ==0:
    x = x-1
if A%D ==0:
    y = y-1


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

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

Solution (Python):
def b():
    
    import math
    a_hp, a_atk, b_hp, b_atk = map(int, input().split())

    kill_a = math.ceil(a_hp/b_atk)
    kill_b = math.ceil(b_hp/a_atk)
    if kill_b <= kill_a:
        print('Yes')
    else:
        print('No')



if __name__ == "__main__":
    b()

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

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

	

if __name__ == '__main__':
	main()

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

while c>0:
    c=c-b
    count1+=1

while  a>0:
    a=a-d
    count2+=1

if count1>count2:
    print('No')
else:
    print('Yes')

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

for x in range(400):
    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())

def cnt(hp, at):
    return (hp + at-1) // at

if cnt(c, b) <= cnt(a, d):
    print('Yes')
else:
    print('No')

Solution (Python):

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

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

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

Solution (Python):
a = list(map(int, input().split()))
sum_t = a[0]
sum_a = a[2]
flag = 1
winner = 0
while flag:
  sum_a = sum_a - a[1]
  if(sum_a <= 0):
    flag = 0
    break    
  sum_t = sum_t - a[3]
  if(sum_t <= 0):
    winner = 1
    flag = 0
    break   

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

Solution (Python):
def readInt():
    return list(map(int, input().split()))
    
t_h,t_a,a_h,a_a = readInt()

while t_h>0 and a_h>0:
    a_h -= t_a
    t_h -= a_a
    
    
if t_h <= 0 and a_h >0:
    print('No')
else:
    print('Yes')

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

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

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())
if (c + b - 1) // b <= (a + d - 1) // d:
    print('Yes')
else:
    print('No')

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


i = 0
j = 0

while A > 0:
  A -= D
  i +=1

while C > 0:
  C -= B
  j += 1
  
if i >= j:
  print('Yes')
  
else:
  print('No')

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

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

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

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

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

if A-D*(Nk-1)<=0:
    print("No")
else:
    print("Yes")

Solution (Python):
a,b,c,d = map(int,input().split())
def num(x,y):
  if x%y==0:
    return x//y
  else:
    return x//y +1
if num(a,d)<num(c,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):
nums = input()
Hp_Taka = int(nums.split(' ')[0])
Atk_Taka = int(nums.split(' ')[1])
Hp_Aoki = int(nums.split(' ')[2])
Atk_Aoki = int(nums.split(' ')[3])

while Hp_Taka > 0 and Hp_Aoki > 0:
	Hp_Aoki = Hp_Aoki - Atk_Taka
	if Hp_Aoki > 0:
		Hp_Taka = Hp_Taka - Atk_Aoki
if Hp_Taka > 0:
	print('Yes')
else:
	print('No')

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

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

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

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

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

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

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