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

"""S,W = map(int,input().split())
if S<=W:
    print('unsafe')
else:
    print('safe')

N = int(input())
S = [input() for i in range(N)]
print(len(set(S)))



S = list(input())[::-1]
N = len(S)
M = [(int(S[i])*10**i)%2019 for i in range(N)]
SS = [M[0]]
for i in range(1,N):
    
    SS.append((SS[-1]+M[i])%2019)
count = [0]*2019
for i in range(N):
    count[SS[i]] += 1

ans = 0
for c in range(len(count)):
    if c==0:
        ans += (count[c] * (count[c] + 1)) // 2
    ans += (count[c] * (count[c] - 1)) // 2

print(ans)
"""
A,B,C,D = map(int,input().split())
f = True
while True:
    if C-B>0:
        C-=B
    else:
        f = True
        break
    if A-D>0:
        A -= D
    else:
        f = False
        break
    
if f:
    print('Yes')
else:
    print('No')

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

while True:
    a -= B
    t -= D
    if a <= 0 or t <= 0:
        break
if a <= 0:
    print("Yes")
else:
    print("No")

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

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

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

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

for i in range(101):
    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())
import math


if c/b < a/d or math.ceil(c/b) - math.ceil(a/d) < 1:
    print('Yes')
else:
    print('No')

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

flag = 1

while True:
    if M[2] > 0:
        M[2] = M[2]-M[1]
        flag = flag * -1
        if M[2] <= 0:
            break
    else:
        break
    if M[0] > 0:
        M[0] = M[0]-M[3]
        flag = flag * -1
        if M[0] <= 0:
            break
    else:
        break
    




if flag == -1:
    print('Yes')
else:
    print('No')

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

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

myturn = True
while a>0 and c>0:
    if myturn:
        c -= b
    else:
        a -= d
    myturn = not myturn

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

Solution (Python):
a = list(map(int,input().split()))
t1 = a[0]
t2 = a[1]
a1 = a[2]
a2 = a[3]

if a1%t2 == 0:
  if a1/t2 < t1/a2+1:
    print("Yes")
  else:
    print("No")
else:
  if a1/t2 < t1/a2:
    print("Yes")
  elif (a1//t2 == t1//a2) and (t1%a2 != 0):
    print("Yes")
  elif (a1//t2 == t1//a2) and (t1%a2 == 0):
    print("No")
  else:
    print("No")

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

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

Solution (Python):
import sys
a,b,c,d = map(int,input().split())
a_life = c-b
t_life = a-d
if a_life<=0:
  print('Yes')
  sys.exit()
elif t_life<=0:
  print('No')
  sys.exit()


while(a_life>0 or t_life>0):
  a_life -= b
  if a_life<=0:
    print('Yes')
    sys.exit()
  t_life -= d
  if t_life<=0:
    print('No')
    sys.exit()

Solution (Python):
import sys
import math
import bisect

def solve(a, b, c, d):
    cur = 0
    while True:
        if cur == 0:
            c -= b
            if c <= 0:
                return True
        else:
            a -= d
            if a <= 0:
                return False
        cur = (cur + 1) % 2
    return None

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

if __name__ == "__main__":
    main()

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

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

Solution (Python):
abcd = input().split()

a = int(abcd[0])
b = int(abcd[1])

c = int(abcd[2])
d = int(abcd[3])


def zero(x,y):
  if x <= 0:
    return("Yes")
  elif y <= 0:
    return("No")

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

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

Solution (Python):
import sys
a,b,c,d = map(int,input().split())
a_life = c-b
t_life = a-d
if a_life<=0:
  print('Yes')
  sys.exit()
elif t_life<=0:
  print('No')
  sys.exit()


while(a_life>0 or t_life>0):
  a_life -= b
  if a_life<=0:
    print('Yes')
    sys.exit()
  t_life -= d
  if t_life<=0:
    print('No')
    sys.exit()

Solution (Python):
def inputlist():
    return [int(i) for i in input().split()]


def main():
    A, B, C, D = inputlist()
    boolTurnTaka = True
    while A > 0 and C > 0:
        if boolTurnTaka:
            C -= B
            boolTurnTaka = False
        else:
            A -= D
            boolTurnTaka = True

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


if __name__ == '__main__':
    main()

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

    if (A // D) == (C // B): 
        if (A % D) == 0 and (C % B) != 0:
            print("No")
        else:
            print("Yes")
    elif (C // B) < (A // D):
        print("Yes")
    else:
        if (C // B) == ((A // D) + 1) and (C % B) == 0:
            print("Yes")
        else:
            print("No")

if __name__ == "__main__":
    resolve()

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

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

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

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

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

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

Solution (Python):
A,B,C,D = (int(x) for x in input().split())
f = True
while True:
    if f:
        C = C - B
        f = False
    else:
        A = A - D
        f = True
    if A <= 0:
        print('No')
        break
    elif C <= 0:
        print('Yes')
        break
    else:
        continue

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

if A % D == 0:
    TA = A // D - 1
else:
    TA = A // D 

if C % B == 0:
    AO = C // B - 1
else:
    AO = C // B
    

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

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

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

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

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

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

Solution (Python):
a, b, c, d = map(int, input().split())
ret = "Yes"
while a > 0 and c > 0:
    c = c - b
    if c <= 0:
        ret = "Yes"
        break
    a = a - d
    if a <= 0:
        ret = "No"
        break
print("{}".format(ret))

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):
a,b,c,d = (int(x) for x in 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())
print('Yes' if (-(-c // b)) <= (-(-a // d)) else 'No')

Solution (Python):
a=list(map(int,input().split()))
takahashi=0
takahashicount=0
aoki=0
aokicount=0

for i in range(a[2]):
    aoki+=a[1]
    if (a[2]-aoki)>0:
        aokicount+=1
    elif (a[2]-aoki)==0:
        break
    else:
        break
        
for i in range(a[0]):
    takahashi+=a[3]
    if (a[0]-takahashi)>0:
        takahashicount+=1
    elif (a[0]-takahashi)==0:
        break
    else:
        break
if takahashicount==aokicount:
    print("Yes")
elif takahashicount>aokicount:
    print("Yes")
elif takahashicount<aokicount:
    print("No")

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

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

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

Solution (Python):
import math

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

if e >= f:
    print("Yes")
else:
    print("No")

Solution (Python):
from sys import stdin, stdout  
import math
def main(): 
	a, b, c, d = [int(x) for x in stdin.readline().split()] 
	
	if math.ceil(c / b) <= math.ceil(a / d):
		stdout.write('Yes \n')
	else:
		stdout.write('No \n')
if __name__ == "__main__": 
	main()

Solution (Python):
import math
in1=input()
in2=in1.split()
a=int(in2[0])
b=int(in2[1])
c=int(in2[2])
d=int(in2[3])
taka=math.ceil(a/d)
ao=math.ceil(c/b)
if taka<ao:
  print("No")
else:
  print("Yes")

Solution (Python):


iim = lambda: map(int, input().rstrip().split())

def resolve():
    A, B, C, D = iim()

    def cnt(a, b):
        c, d = divmod(a, b)
        if d:
            c += 1
        return c

    a1 = cnt(C, B)
    a2 = cnt(A, D)
    print("Yes" if a1 <= a2 else "No")

if __name__ == "__main__":
    resolve()

Solution (Python):


import sys
import math
import collections
import itertools
from inspect import currentframe
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]

A, B, C, D = LI()

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

Solution (Python):

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

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

Solution (Python):
A, B, C, D = list(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):
import math

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

Solution (Python):
a, b, c, d = map(int, input().split())
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())
e = c // b
f = a // d
g = c % b
h = a % d
if e < f:
    print("Yes")
if e > f+1:
    print("No")
if e == f+1:
    if g == 0 and h !=0:
        print("Yes")
    else:
        print("No")
if e == f:
    if g != 0 and h ==0:
        print("No")
    else:
        print("Yes")

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

while True:
	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())
while A>0:
    C-=B
    if(C<=0):
        break
    A-=D
if(C<=0):
    print('Yes')
else:
    print('No')

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

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

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

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

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

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

H=A
P=C
while (True):
    P=P-B

    if  P<=0:
        print("Yes")
        break

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

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

def calc_kill_num(hp, attack):
	if hp < attack:
		return 1
	attack_num, mod = divmod(hp, attack)
	if mod > 0:
		return attack_num + 1
	else:
		return attack_num

t_kill_a_num = calc_kill_num(C, B)
a_kill_t_num = calc_kill_num(A, D)


if t_kill_a_num <= a_kill_t_num:
	print("Yes")
else:
	print("No")

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

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

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

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

Solution (Python):
N = input().split(" ")
TL = int(N[0])
TA = int(N[1])
AL = int(N[2])
AA = int(N[3])
a = 0

while a == 0:
  AL = AL - TA
  if AL <= 0:
    a = 1
    break
  TL = TL - AA
  if TL <= 0:
    a = 2
    break
if a == 1:
  print("Yes")
elif a == 2:
  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())
flag = 1
while a > 0 or c > 0:
    if flag:
        c -= b
        flag = 0
    else:
        a -= d
        flag = 1
if flag:
    print('Yes')
else:
    print('No')

Solution (Python):
import math
A, B, C, D = input().split()
 
if math.ceil(int(C)*1.0/(int(B)*1.0)) <= math.ceil(int(A)*1.0/(int(D)*1.0)):
  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())
s=0
t=0
while A>0:
  A-=D
  s+=1
  if A<=0:
    break
while C>0:
  C-=B
  t+=1
  if C<=0:
    break
if s>=t:
  print("Yes")
else:
  print("No")

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

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

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

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

Solution (Python):
import math

list1 = list(map(int, input().strip().split()))
a = list1[0]
b = list1[1]
c = list1[2]
d = list1[3]


k = math.ceil(a/d)
l = math.ceil(c/b)

if k>=l:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c,d=map(int,input().split())
for i in range(200):
    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())
for i in range(100):
  c-=b
  if c<=0:
    print('Yes')
    quit()
  a-=d
  if a<=0:
    print('No')
    quit()

Solution (Python):
import math

a, b, c, d = map(int, input().split())
T = a//d + a%d*0.1
A = c//b + c%b*0.1

T = math.ceil(T)
A = math.ceil(A)

if T >= A:
    print("Yes")
else:
    print("No")

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

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

for i in range(1,101):

    if c-(b*i) <= 0:
        print("Yes")
        break
    elif a-(d*i) <= 0:
        print("No")
        break
    else:
        None

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

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

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

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

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

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


if __name__ == '__main__':
    q2()

Solution (Python):
from math import ceil

h1, s1, h2, s2 = map(int, input().split())
moves_of_takashi = ceil(h2/s1)
moves_of_aoka = ceil(h1/s2)

if moves_of_takashi <= moves_of_aoka:
    print("Yes")
else:
    print("No")

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

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

for i in range (100):
    C = c - i*b
    if(C<=0):
        break
    A = a - i*d
    if(C<=0):
        break
    
if(A <= 0):
    print('No')
else :
    print('Yes')

Solution (Python):

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

Solution (Python):

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

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

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

a_hp = data[0]
a_at = data[1]
b_hp = data[2]
b_at = data[3]

while True:
    if b_hp - a_at <= 0:
        print("Yes")
        break
    elif b_hp - a_at > 0:
        b_hp -= a_at
    
    if a_hp - b_at <= 0:
        print("No")
        break
    elif a_hp - b_at > 0:
        a_hp -= b_at

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

Solution (Python):
l = input().split()
a_hp = int(l[0])
a_at = int(l[1])
b_hp = int(l[2])
b_at = int(l[3])
a_s = a_hp // b_at
a_a = a_hp % b_at
b_s = b_hp // a_at
b_a = b_hp % a_at

if a_a > 0:
  a_s += 1
if b_a > 0:
  b_s += 1
if a_s >= b_s:
  print('Yes')
else:
  print('No')

Solution (Python):
takahasi_HP, takahasi_ATK, aoki_HP, aoki_ATK = map(int, input().split())

while True:
    aoki_HP -= takahasi_ATK
    if aoki_HP  <= 0:
        print("Yes")
        break
    takahasi_HP -= aoki_ATK
    if takahasi_HP <= 0:
        print("No")
        break

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

while True:
    h2 -= s1
    if h2 <= 0:
        print("Yes")
        break

    h1 -= s2
    if h1 <= 0:
        print("No")
        break

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

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

num=0
num2=0
for i in range(101):
    num+=B
    num2+=D

    if num >= C:
        print("Yes")
        break
    elif num2 >= A:
        print("No")
        break

Solution (Python):
import re
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):
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):
rist = input().split()
while int(rist[0])>0 and int(rist[2])>0:
  if int(rist[2])-int(rist[1])<=0:
    print("Yes")
    break
  else:
    rist[2] = int(rist[2])-int(rist[1])
 
  if int(rist[0])-int(rist[3])<=0:
    print("No")
    break
  else:
    rist[0] = int(rist[0])-int(rist[3])

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

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


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

Solution (Python):
def main():
    a, b, c, d = map(int, input().split())
    kai_a = a // d
    kai_c = c // b
    amari_a = a % d
    amari_c = c % b
    
    if kai_a > kai_c:
        print('Yes')
    elif kai_a == kai_c:
        if amari_c == 0:
            print('Yes')
        elif amari_a == 0:
            print('No')
        else:
            print('Yes')
    else:
        if amari_c == 0 and amari_a > 0:
            print('Yes')
        else:
            print("No")

 
if __name__ == '__main__':
    main()

Solution (Python):
monsterAHP, monsterAAttack, monsterBHP, monsterBAttack = map(int, input().split(' '))
turnA = int(monsterBHP / monsterAAttack)
modA = monsterBHP % monsterAAttack
turnB = int(monsterAHP / monsterBAttack)
modB = monsterAHP % monsterBAttack

if(modA != 0):
  turnA = turnA + 1
  
if(modB != 0):
  turnB = turnB + 1

if(turnA > turnB):
  print('No')
else:
  print('Yes')

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

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

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

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

t,tmod = divmod(a, d)
a,amod = divmod(c , b)

if tmod >0:
  t = t+1
if amod >0:
  a = a+1

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

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

k=0

while(1):
    c=c-b
    a=a-d
    if(c <=0):
        k=1
        break
    if(a<=0):
        k=2
        break

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

Solution (Python):
tak_health, tak_attack, aoki_health, aoki_attack = list(map(int, input().split()))

game = True

while game:
    if aoki_health > 0:
        aoki_health -= tak_attack
    if tak_health > 0:
        tak_health -= aoki_attack
    if aoki_health <= 0:
        print("Yes")
        game = False
    elif tak_health <= 0:
        print("No")
        game = False

Solution (Python):
i = list(map(int, input().split()))
tp = i[0]
ta = i[1]
ap = i[2]
aa = i[3]
while tp > 0 and ap > 0:
  
  ap = ap - ta
  
  
  
  if ap <= 0:
    print('Yes')
    break
  tp = tp - aa
  
  
  if tp <= 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())

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

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

t_hp = A
t_ap = B
a_hp = C
a_ap = D

while True :
    
    a_hp = a_hp - t_ap
    if a_hp <= 0 :
        print('Yes')
        break

    
    t_hp = t_hp - a_ap
    if t_hp <= 0 :
        print('No')
        break

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

Solution (Python):
N = [int(e) for e in input().split()]
if(N[2]%N[1] !=0):
    ans = (N[2]//N[1])+1
else:
    ans = N[2]//N[1] 
for i in range(1,ans):
    N[0] -= N[3]
    if(N[0] <= 0):
        print('No')
        break
else:
    print('Yes')

Solution (Python):
A = list(map(int, input().strip().split(' ')))
flag = True

while flag:
    A[2] = A[2] - A[1]
    if not A[2] > 0:
        print('Yes')
        break
    A[0] = A[0] - A[3]
    if not A[0] > 0:
        print('No')
        flag = False

Solution (Python):

N=list(map(int,input().split()))
if N[2]<=N[1]:
    print("Yes")
    exit()

takahashi=N[2]/N[1]
aoki=N[0]/N[3]

if aoki%1!=0:
   aoki=aoki+1 

if takahashi%1!=0:
    takahashi=takahashi+1
    

if takahashi<=aoki:
  print("Yes")
else:
  print("No")

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

aoki = c
takahashi = a

for i in range(101):
  if aoki - b > 0: 
    if takahashi - d <= 0: 
      print("No")
      break
    else: 
      takahashi = takahashi - d
      aoki = aoki - b
      continue
  else: 
    print("Yes")
    break

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

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

A,B,C,D=[int(x) for x in input().split()]
count=0
while A*C>0:
    if count%2==0:
        C-=B
    else:
        A-=D
    count+=1
if count%2==0:
    print("No")
else:
    print("Yes")

Solution (Python):
a, b, c, d = [int(x) for x in input().split()] 
while (a >= 0) or (c >= 0):
    c = c - b
    if c <= 0:
        print('Yes')
        break
    a = a - d
    if a <= 0:
        print('No')
        break

Solution (Python):
a,b,c,d = map(int,input().split())
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=list(map(int,input().split()))
def kaisuu(a,b):
    
    if a%b == 0:
        return a/b
    else:
        return a//b+1
if kaisuu(a[2],a[1])>kaisuu(a[0],a[3]):
    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())
def battle(A,B,C,D):
    C=C-B
    A=A-D
    if C<=0 and A<=0:
        print("Yes")
    elif C<=0 and A>0:
        print("Yes")
    elif C>0 and A<=0:
        print("No")
    else:
         battle(A,B,C,D)

battle(A,B,C,D)

Solution (Python):
battle = list(map(int, input().split()))
a_HP = battle[0]
a_ATK = battle[1]
b_HP = battle[2]
b_ATK = battle[3]

while(b_HP>=0):
    b_HP -= a_ATK
    if b_HP <= 0:
        print("Yes")
        break
    a_HP -= b_ATK
    if a_HP <= 0:
        print("No")
        break

Solution (Python):
A, B, C, D = map(int, input().split())
TN = A // D 
Tmod = A % D
AN = C // B
Amod = C % B
if Tmod>0:
    TN+=1 
if Amod>0:
    AN+=1
if AN<=TN:
    print('Yes')
else:
    print('No')

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

a = int(a)
b = int(b)
c = int(c)
d = int(d)
 
r1 = c // b
r2 = a // d 

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

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

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

Solution (Python):
takahashiSTA, takahashiAttack, aokiSTA, aokiAttack = map(int, input().split())
result = ""

while True:
    aokiSTA -= takahashiAttack 
    if aokiSTA <= 0:
        result = "Yes"
        break

    takahashiSTA -= aokiAttack  
    if takahashiSTA <= 0:
        result = "No"
        break 

print(result)

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

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

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