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

Solution (Python):
h_1,a_1,h_2,a_2 = map(int,input().split())

h_2//a_1
h_1//a_2

if h_2%a_1!=0 and h_1%a_2!=0:
    if h_2//a_1 <= h_1//a_2:
        print("Yes")
    else:
        print("No")
elif h_2%a_1!=0 and h_1%a_2==0:
    if h_2//a_1+1 < h_1//a_2:
        print("Yes")
    else:
        print("No")
elif h_2%a_1==0 and h_1%a_2!=0:
    if h_2//a_1 <= h_1//a_2+1:
        print("Yes")
    else:
        print("No")
else:
    if h_2//a_1 <= h_1//a_2:
        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= C-B
  if C <= 0:
    print ("Yes")
    break
  else:
    A= A-D
    if A <= 0:
      print("No")
      break

Solution (Python):
t_tairyoku, t_kougeki, a_tairyoku, a_kougeki = map(int, input().split())

winner=""
while True:
    a_tairyoku = a_tairyoku-t_kougeki
    if a_tairyoku <= 0:
        winner="takahashi"
        break
    t_tairyoku = t_tairyoku-a_kougeki
    if t_tairyoku <= 0:
        winner ="aoki"
        break

if winner == "takahashi":
    print("Yes")
else:
    print("No")

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

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

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

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

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

Solution (Python):


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

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

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

for i in range(1000):
    if i % 2 == 0:
        C -= B
    else:
        A -= D

    if min(A, C) <= 0:
        print('Yes' if i % 2 == 0 else '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())

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

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

if attack_a >= attack_t:
    print("Yes")
else:
    print("No")

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

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

Solution (Python):
t_hp,t_at,a_hp,a_at=map(int,input().split())
while(t_hp > 0 and a_hp > 0):
  a_hp -= t_at
  if a_hp <= 0:
    print("Yes")
    break
  t_hp -= a_at
  if t_hp <= 0:
         print("No")
         break

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
 
def main():
    a, b, c, d = map(int, input().split())
    x = (a+d-1)//d
    y = (c+b-1)//b
    if x >= y:
        print('Yes')
    else:
        print('No')
if __name__ == '__main__':
    main()

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

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

while A > 0 and C > 0:
  C -= B
  if C <= 0:
    print('Yes')
    exit();
  else:
    A -= D
    
  if A <= 0:
    print('No')

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

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

Solution (Python):
t_t,t_a,a_t,a_a=map(int,input().split())

for i in range(101):
    a_t -= t_a
    if a_t <= 0:
        print('Yes')
        break

    t_t -= a_a
    if t_t <= 0:
        print('No')
        break

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

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

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

Solution (Python):

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

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

taka = (a - 1 + d) // d
aoki = (c - 1 + b) // b

if taka < aoki:
    ans = "No"
else:
    ans = "Yes"

print(ans)

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

p=math.ceil(a/d)
q=math.ceil(c/b)

if p>=q:
  print('Yes')
else:
  print('No')

Solution (Python):
a, b, c, d = map(int, input().split())
while a or c:
    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())
takahashi = -(-a // d)
aoki = -(-c // b)
print("Yes") if takahashi >= aoki else print("No")

Solution (Python):
hT, sT, hA, sA = map(int, input().split())
win = ''
while True:
    hA = hA-sT
    if hA <= 0:
        win = 'Yes'
        break
    hT = hT - sA
    if hT <= 0:
        win = 'No'
        break
print(win)

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

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

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

Solution (Python):
def main():
    a, b, c, d = map(int, input().split())
    x = 0
    while 0 < a and 0 < c:
        if x%2 == 0:
            c -= b
        else:
            a -= d
        x += 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:
        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:
    a -= d
  else:
    c -= b
  i += 1

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

Solution (Python):
a,b,c,d = map(int,input().split())
while 1:
    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(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 = list(map(int,input().split()))
T = -(-C//B)
AO = -(-A//D)
print('Yes' if T<=AO else 'No')

Solution (Python):
import math as mt
import collections as cc
I=lambda:list(map(int,input().split()))
a,b,c,d=I()
x=(a//d)+(1 if a%d else 0)
y=(c//b)+(1 if c%b else 0)
if x==y:
    print('Yes')
elif x<y:
    print('No')
else:
    print('Yes')

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

Solution (Python):

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


turn = 0

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


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

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

d1 = A // D + 1
if A % D == 0:
  d1 -= 1

d2 = C // B + 1
if C % B == 0:
  d2 -= 1

  
if d1 >= d2:
  print ("Yes")
else:
  print ("No")

Solution (Python):
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7 
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    a, b, c, d = map(int,input().split())
    takahashi = (c - 1) // b
    aoki = (a - 1) // d
    print("Yes" if takahashi <= aoki else "No")
resolve()

Solution (Python):
h1, a1, h2, a2 = map(int, input().split())

n1 = h1//a2 + (h1%a2 != 0)
n2 = h2//a1 + (h2%a1 != 0)

if n2 <= n1:
    print("Yes")
else:
    print("No")

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

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

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

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

taka = math.ceil(c/b)
ao = math.ceil(a/d)

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

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

Solution (Python):
TH, TS, AH, AS = [int(s) for s in input().split(" ")]
turn = True
while True:
  if turn:
    AH -= TS
    if AH <= 0:
      print('Yes')
      break
    turn = not turn
  else:
    TH -= AS
    if TH <= 0:
      print('No')
      break
    turn = not turn

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

x = (A + D - 1) // D
y = (C + B - 1) // B
if x >= y:
    print('Yes')
else:
    print('No')

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

Solution (Python):
tkhp, tkat, aohp, aoat = list(map(int, input().split()))

while True:
    aohp -= tkat
    if aohp <= 0:
        print("Yes")
        break

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

T = -1*(-1*c//(b))
A = -1*(-1*a//(d))

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

Solution (Python):
a,b,c,d=map(int,input().split())
print('YNeos'[-a//d>-c//b::2])

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


def main():
    a, b, c, d = map(int, input().split())
    res = solve(a, b, c, d)
    print(res)


def test():
    assert solve(10, 9, 10, 10) == "No"
    assert solve(46, 4, 40, 5) == "Yes"


if __name__ == "__main__":
    test()
    main()

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

    return 0

if __name__ == '__main__':
    main()

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):
num = list(map(int, input().split())) 

N=num[2]/num[1]

if(N==int(N)):
    N=int(N)-1
else:
    N=int(N)

if(N*num[3]<num[0]):
    print("Yes")
else:
    print("No")

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

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

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

if (c+b-1)//b > (a+d-1)//d :
    print('No');
else :
    print('Yes');

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

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')


A, B, C, D = MI()
t = -(-C // B)
a = -(-A // D)
print('Yes' if t <= a else 'No')

Solution (Python):
a,b,c,d=map(int,input().split())
print("No"if (a+d-1)//d<(b+c-1)//b else"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):
T, TA, A, AA = map(int, input().split())
TTime = T // AA if T % AA == 0 else T // AA + 1
ATime = A // TA if A % TA == 0 else A // TA + 1
print('Yes' if TTime >= ATime else 'No')

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

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

takahashi_turn = True
while (p[0]>0) and (p[2]>0):
    if takahashi_turn:
        p[2] = p[2] - p[1]
    else:
        p[0] = p[0] - p[3]
    takahashi_turn = not takahashi_turn

if p[0] > 0:
    print("Yes")
else:
    print("No")

Solution (Python):
def Sol(taka_health,taka_stregnth,aoki_health,aoki_stregnth):
    
    if taka_health%aoki_stregnth != 0:
        moves_taka = int(taka_health/aoki_stregnth) + 1
    else:
        moves_taka = int(taka_health/aoki_stregnth)
    
    if aoki_health%taka_stregnth != 0:
        moves_aoki =int(aoki_health/taka_stregnth) + 1
    else:
        moves_aoki = int(aoki_health/taka_stregnth)
    
    if moves_taka >= moves_aoki:
        print("Yes")
    else:
        print("No")
    return

    


n,k,d,c = map(int,input().split())









Sol(n,k,d,c)

Solution (Python):
taka_hp, taka_atk, aoki_hp, aoki_atk = [int(x) for x in input().split()]
a = False
while a == False:
    aoki_hp -= taka_atk
    if aoki_hp <= 0:
        a = True
        print('Yes')
        break
    taka_hp -= aoki_atk
    if taka_hp <= 0:
        a = True
        print('No')
        break

Solution (Python):
TAKA_HP, TAKA_POW, AOKI_HP, AOKI_POW = [int(i) for i in input().split(" ")]

taka = True
while True:
    if taka:
        AOKI_HP -= TAKA_POW
        if AOKI_HP <= 0:
            print("Yes")
            exit()
        taka = False
        continue
    else:
        TAKA_HP -= AOKI_POW
        if TAKA_HP <= 0:
            print("No")
            exit()
        taka = True
        continue

Solution (Python):
a_life, a_attk, b_life, b_attk = [int(i) for i in input().split()]

i = 0
while(True):
  if i % 2 == 0:
    b_life -= a_attk
  else:
    a_life -= b_attk
  i += 1
  if b_life <= 0:
    print("Yes")
    break
  elif a_life <= 0:
    print("No")
    break

Solution (Python):
thp, tap, ahp, aap = map(int, input().split())

x = (thp + aap - 1) // aap
y = (ahp + tap - 1) // tap

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

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

ans_1 = math.ceil(c / b)
ans_2 = math.ceil(a / d)


if ans_1 > ans_2:
    print("No")
else:
    print("Yes")

Solution (Python):
taka_hp, taka_atk, aoki_hp, aoki_atk = [int(x) for x in input().split()]
a = False
while a == False:
    aoki_hp -= taka_atk
    if aoki_hp <= 0:
        a = True
        print('Yes')
        break
    taka_hp -= aoki_atk
    if taka_hp <= 0:
        a = True
        print('No')
        break

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

Solution (Python):
a,b,c,d = map(int,input().split())
taka = [a,b]
ao = [c,d]
flag = True

while a > 0 or c > 0:
    c -= b
    if c <= 0:
        break
    a -= d
    if a <= 0:
        flag = False
        break

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

Solution (Python):
test = list(map(int, input().split()))
A = test[0] 
B = test[1] 
C = test[2] 
D = test[3] 
flag = True
while flag:
    C -= B
    if C <=0:
        print('Yes')
        flag = False
        break
    A -= D
    if A <= 0:
        print('No')
        flag = False
        break

Solution (Python):
thp, tap, ahp, aap = map(int, input().split())

while True:
    ahp -= tap
    if ahp > 0:
        thp -= aap
    else:
        print('Yes')
        break

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

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

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

Solution (Python):
from sys import stderr
from math import ceil

a_takahashi_hp, b_takahashi_attack, c_aoki_hp, c_aoki_attack = map(int, input().split())

takahashi_died_turn_at = ceil(a_takahashi_hp / c_aoki_attack) * 2
aoki_died_turn_at = ceil(c_aoki_hp / b_takahashi_attack) * 2 - 1

print(takahashi_died_turn_at, aoki_died_turn_at, file=stderr)

print('Yes' if takahashi_died_turn_at > aoki_died_turn_at else 'No')

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

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

Solution (Python):

import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
from heapq import heappop, heappush

from decimal import *




























def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

inf = float('inf')
mod = 1000000007




def main():
	A,B,C,D = inputMap()

	ss = True
	while True:
		if A <= 0 or C <= 0:
			break

		if ss == True:
			ss = False
			C -= B
		else:
			ss = True
			A -= D

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






def combination(n, r, mod=10**9+7):
    r = min(r, n-r)
    res = 1
    for i in range(r):
        res = res * (n - i) * modinv(i+1, mod) % mod
    return res


def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)

def egcd(a, b):
    if a == 0:
        return b, 0, 1
    else:
        g, y, x = egcd(b % a, a)
        return g, x - (b // a) * y, y



def H(n, r, mod=10**9+7):
	
	
    return combination(n+r-1, r, mod)

class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        
        
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

if __name__ == "__main__":
	main()

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

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

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float("INF")


def solve():
    a, b, c, d = LI()
    print("Yes" if (c - 1) // b + 1 <= (a - 1) // d + 1 else "No")
    return



if __name__ == '__main__':
    solve()

Solution (Python):

def main():
    A, B, C, D = map(int, input().split())
    print("Yes" if (C + B - 1) // B <= (A + D - 1) // D else "No")


if __name__ == "__main__":
    main()

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

Solution (Python):
a,b,c,d=[int(i) for i in input().split()]
f=0
while a>0:
    c-=b
    if c<1:
        f+=1
    a-=d
print("Yes" if f>0 else "No")

Solution (Python):
hp_t, attack_t, hp_a, attack_a = map(int, input().split())
def battle(hp_t, attack_t, hp_a, attack_a, p):
    
    if p == 't':
        hp_a -= attack_t
    else:
        hp_t -= attack_a
        
    if hp_t <= 0:
        return 'No'
    elif hp_a <= 0:
        return 'Yes'
    
    return battle(hp_t, attack_t, hp_a, attack_a, 't' if p == 'a' else 'a')
print(battle(hp_t, attack_t, hp_a, attack_a, 't'))

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

num_t = (c-1)//b + 1
num_a = (a-1)//d + 1

if num_t <= num_a:
    print("Yes")
else:
    print("No")

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

Solution (Python):
import math

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

Solution (Python):
import sys
import math
input = lambda: sys.stdin.readline().rstrip()
Yes = lambda boolean: print('Yes') if boolean else print('No')
ints = lambda: list(map(int, input().split()))
a,b,c,d = ints()
Yes(math.ceil(a/d)>=math.ceil(c/b))

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

T_time = C // B if C % B == 0 else C // B + 1
A_time = A // D if A % D == 0 else A // D + 1

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

Solution (Python):

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

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

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

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

Solution (Python):
s=input()


a,b,c,d=map(int,s.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:
        ans = 'Yes'
        break
    a -= d
    if a <= 0:
        ans = 'No'
        break
print(ans)

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 math
def main(a,b,c,d):
    taka = math.ceil(a/d)
    aoki = math.ceil(c/b)
    return "Yes" if taka >= aoki else "No"

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

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

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

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

Solution (Python):
th, ta, ah, aa = map(int, input().split( ))
while th > 0 and ah > 0:
    ah -= ta
    
    if ah <= 0:
        print("Yes")
        break
    th -= aa
    if th <= 0:
        print("No")

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

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

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

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

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

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

Solution (Python):
A, B, C, D = [int(i) for i in input().split()]
x = (A + D - 1) // D
y = (C + B - 1) // B
print('Yes' if x >= y else 'No')

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

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

Solution (Python):
import math
a,b,c,d=map(int, input().split())
N=math.ceil(c/b)
print(["No","Yes"][a-(N-1)*d>0])

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

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

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

    attack_count_A = C // B
    if C % B > 0:
        attack_count_A += 1
    
    attack_count_B = A // D
    if A % D > 0:
        attack_count_B += 1

    if attack_count_B >= attack_count_A:
        print('{}'.format('Yes'))
    else:
        print('{}'.format('No'))


if __name__ == '__main__':
    main()

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

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

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

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

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

Solution (Python):

import math
A,B,C,D=map(int,input().split())
win=math.ceil(A/D)
lose=math.ceil(C/B)
if lose<=win:
  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
    elif a <= 0:
        print("No")
        break