Problem:
 Score: 200 points    Problem Statement  M-kun has the following three cards:   A red card with the integer A .  A green card with the integer B .  A blue card with the integer C .   He is a genius magician who can do the following operation at most K times:   Choose one of the three cards and multiply the written integer by 2 .   His magic is successful if both of the following conditions are satisfied after the operations:   The integer on the green card is strictly greater than the integer on the red card.  The integer on the blue card is strictly greater than the integer on the green card.   Determine whether the magic can be successful.      Constraints   1 \leq A, B, C \leq 7  1 \leq K \leq 7  All values in input are integers.         Input  Input is given from Standard Input in the following format:  A  B  C  K       Output  If the magic can be successful, print Yes ; otherwise, print No .        Sample Input 1 7 2 5
3      Sample Output 1 Yes  The magic will be successful if, for example, he does the following operations:   First, choose the blue card. The integers on the red, green, and blue cards are now 7 , 2 , and 10 , respectively.  Second, choose the green card. The integers on the red, green, and blue cards are now 7 , 4 , and 10 , respectively.  Third, choose the green card. The integers on the red, green, and blue cards are now 7 , 8 , and 10 , respectively.        Sample Input 2 7 4 2
3      Sample Output 2 No  He has no way to succeed in the magic with at most three operations.

Solution (Python):
A, B, C = map(int, input().split())
K = int(input())
cnt = 0
ans = False
while True:
  if cnt > K:
    break

  if B > A and C > B:
    ans = True
    break

  if B <= A:
    B *= 2
    cnt += 1
    continue
    
  if C <= B:
    C *= 2
    cnt += 1

if ans:
  print('Yes')
else:
  print('No')

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

for k in range(K):
    if not A < B:
        B *= 2
    elif not B < C:
        C *= 2
    else:
        break

print('Yes' if A < B < C else 'No')

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

K = int(input())

flg = False

for i_a in range(K+1):
    for i_b in range(K+1):
        for i_c in range(K+1):
            if(i_a + i_b + i_c <= K):
                score_a = A
                score_b = B
                score_c = C
                for n_a in range(i_a):
                    score_a *= 2
                for n_b in range(i_b):
                    score_b *= 2
                for n_c in range(i_c):
                    score_c *= 2
                if((score_b > score_a) and (score_c > score_b)):
                    flg = True
            
            if(flg):
                break
        if(flg):
            break
    if(flg):
        break

if(flg):
    print('Yes')
else:
    print('No')

Solution (Python):
import sys

r, g, b = list(map(int, input().split()))
k = int(input())

def check():
    if (r < g < b):
        print("Yes")
    else:
        print("No")
    sys.exit()

m = k
for _ in range(k):
    if (r < g):
        break
    
    g *= 2
    m -= 1

if (m < 1):
    check()

mm = m
for _ in range(m):
    if (g < b):
        break
    
    b *= 2
    mm -= 1

check()

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

for i in range(K):
    if A >= B:
        B *= 2
        continue

    if B >= C:
        C *= 2
        continue

if A < B and B < C:
    print('Yes')
else:
    print('No')

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

while A >= B:
    B *= 2
    K -= 1

n = 0

while B >= C:
    n += 1
    C *= 2

if n <= K:
    print('Yes')
else:   
    print('No')

Solution (Python):
a,b,c = map(int,input().split())
import math
k = int(input())
if b <= a:
  while True:
    k -= 1
    b *= 2
    if b > a:
      break
  
if c <= b:
  while True:
    k -= 1
    c *= 2
    if c > b:
      break
      
if k < 0:
  print('No')
else:
  print('Yes')

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

def f(A,B,C):
    if A < B and B < C:
        return True
    else:
        return False

for i in range(1, k):
    if f(a, b*(2**i), c*(2**(k-i))):
        print('Yes')
        sys.exit()

if f(a,b*(2**k),c):
    print('Yes')
    sys.exit()

if f(a,b,c*(2**k)):
    print('Yes')
    sys.exit()

print('No')

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

Solution (Python):
num=input().split(" ")
num1=int(input())
A=int(num[0])
B=int(num[1])
C=int(num[2])
sum=0
while A>=B:
    sum+=1
    B=2*B
while B>=C:
    sum+=1
    C=2*C
if sum>num1:
    print("No")
else:
    print("Yes")

Solution (Python):
def solve(A, B, C, K):
    magic = 0
    while A >= B:
        B *= 2
        magic += 1
    while B >= C:
        C *= 2
        magic += 1
    print('Yes' if magic <= K else 'No')


if __name__ == '__main__':
    
    
    A, B, C = map(int, input().split())
    K = int(input())
    
    
    solve(A, B, C, K)

Solution (Python):
def main():
    A,B,C  = map(int,input().split())
    K = int(input())
    cnt = 0
    while(A >= B):
        B *= 2
        cnt += 1
    while(B >= C):
        C *= 2
        cnt += 1
    if K >= cnt:
        print('Yes')
    else:
        print('No')
if __name__ == '__main__':
    main()

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import numpy as np
import sys
sys.setrecursionlimit(10**7)

def _S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())


R,G,B = LI()
K = I()

count = 0

GR = False
while not GR:
    if G <= R:
        G *= 2
        count +=1
    else:
        GR = True

BG = False
while not BG:
    if B <= G:
        B *= 2
        count +=1
    else:
        BG = True

if count <= K:
    print('Yes')
else:
    print('No')

Solution (Python):
A,B,C=map(int,input().split())
K=int(input())
flag=True
for i in range(K):
    if A>=B:
        B*=2
        continue
    if B>=C:
        C*=2
        continue
    if C>B and B>A:
        flag=False
        break
if C>B and B>A:
    flag=False
print('Yes' if flag==False else "No")

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

cnt = 0
while not(a<b<c):
    if a >= b:
        b = 2*b
    else:
        if b >= c:
            c = 2*c
    
    cnt += 1

if cnt <= k:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c=map(int,input().split())
k=int(input())
while k>0:
    k-=1
    if a>=b:
        b*=2
    elif b>=c:
        c*=2
    else:
        pass
if b>a and c>b:
    print("Yes")
else:
    print('No')

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

for i in range(k):
    if a >= b:
        b *= 2
    elif b >= c:
        c *= 2
    elif a < b and b < c:
        break


if a < b and b < c:
    print('Yes')
else:
    print('No')

Solution (Python):
A,B,C = map(int,input().split())
K = int(input())
frag = False
for i in range(K):
    if A >= B:
        B = 2 * B
    elif B >= C:
        C = C * 2
    
if  A < B and B < C:
    print("Yes")
else:
    print("No")

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

K = int(input())
K+=1

resu = 0

for k in range(K):
    if A>=B:
        B=B*2
    elif B>=C:
        C=C*2
    else:
        print("Yes")
        break
else:
    print("No")

Solution (Python):

"""
@author: H_Hoshigi
"""
def main():
    A, B, C = map(int, input().split())
    K = int(input())

    answer = "No"
    for i in range(K):
        if A>=B:
            B *= 2
        elif B>=C:
            C *= 2
    if A<B and B<C:
        answer = "Yes"
    print(answer)

if __name__ == "__main__":
    main()

Solution (Python):
a, b, c = map(int, input().split())
k = int(input())
for i in range(k):
    if a >= b:
        b *= 2
    elif b >= c:
        c *= 2
if a < b < c:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
sys.setrecursionlimit(4100000)
import math
import itertools
INF = float('inf')
from heapq import heapify, heappop, heappush

def main():
    a,b,c = map(int, input().split())
    k = int(input())

    tmp = 0

    for i in range(k+1):
        for j in range(k+1-i):
            for l in range(k+1-i-j):
                _a = a * 2**i
                _b = b * 2**j
                _c = c * 2**l
                if _a < _b and _b < _c:
                    print('Yes')
                    return
    print('No')



if __name__ == '__main__':
    main()

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

for i in range(K):
  if A>=B:
    B = B*2
    continue
  if B>=C:
    C = C*2
    continue

if A<B<C:
  flag = True
    
print("Yes") if flag else print("No")

Solution (Python):

import math
import numpy

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

K =int(input())
flg = False
i = 0
while a >= b:
    if i == K:
        break
    b *= 2
    i += 1
    
    
while b >= c:
    if i == K:
        break
    c *= 2
    i += 1
    

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

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

while k:
    if a>=b:
        b *= 2
        k -= 1
    elif b>=c:
        c *= 2
        k -= 1
    else:
        break

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

Solution (Python):
import sys
import numpy as np
import math  
from collections import deque
from collections import defaultdict
from copy import deepcopy
from itertools import accumulate 
def input(): return sys.stdin.readline().rstrip()
from functools import lru_cache 

def main():
    a, b, c = list(map(int,input().split()))
    n = int(input())
    for _ in range(n):
        
        if a >= b:
            b = b * 2
            continue
        if b >= c:
            c = c * 2
            continue
    if a < b and b < c:
        print("Yes")
    else: print("No")
    return 0

if __name__ == "__main__":
    main()

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

count = 0
while True:
    if b > a:
        break
    b *= 2
    count += 1
while True:
    if c > b:
        break
    c *= 2
    count += 1
if count <= k:
    print("Yes")
else:
    print("No")

Solution (Python):
word = input()
nums = word.split()
numin = [0,0,0]
seiko = 0
for j in range(3):
    numin[j] = int(nums[j])
k = int(input())

for i in range(k+1):
    if numin[0] >= numin[1]:
        numin[1] *= 2
    elif numin[1] >= numin[2]:
        numin[2] *= 2
    else:
        seiko = 1
        print('Yes')
        break

if seiko == 0:
    print('No')

Solution (Python):
a,b,c = map(int, input().split())
k = int(input())
aa,bb,cc = a,b,c
ans = False
for i in range(k,-1,-1):
  aa,bb,cc = a,b,c
  cc *= 2**i
  bb *= 2**(k-i)
  if cc>bb>aa:
    ans = True
    break
    
if ans:
  print('Yes')
else:
  print('No')

Solution (Python):
import math
def resolve():
    A,B,C = map(int,input().split())
    K = int(input())
    if A < B:
        magic_B = 0
    else:
        magic_B = int(math.log2(A/B)) + 1
    B_mult = B * pow(2,magic_B)

    if B_mult < C:
        magic_C = 0
    else:
        magic_C = int(math.log2(B_mult/C)) + 1
    
    if magic_B + magic_C <= K:
        print("Yes")
    else:
        print("No")
resolve()

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

for _ in range(K):
    if A >= B:
        B=B*2
    else:
        C=C*2

if A<B and B<C:
    print('Yes')
else:
    print('No')

Solution (Python):
import math

aka, mi, ao = map(int, input().split(" "))
k = int(input())

for i in range(k):
    if mi <= aka:
        mi *= 2
        continue
    if ao <= mi:
        ao *= 2
        continue
    ao *= 2

if ao > mi > aka:
    print("Yes")
else:
    print("No")

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

for i in range(K):
  if A >= B:
    B = B * 2
  else:
    C = C * 2

if A < B and B < C:
  print("Yes")
else:
  print("No")

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

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

while A>=B:
    B*=2
    ans+=1
while B>=C:
    C*=2
    ans+=1
if ans>K:
    print("No")
else:
    print("Yes")

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

cnt = 0
while A >= B:
    B *= 2
    cnt += 1

while B >= C:
    C *= 2
    cnt += 1

if cnt <= K:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys

def hantei(A, B, C, K):
  i = 0
  while A >= B:
    if i >= K:
      return False
      sys.exit()
    B *= 2
    i += 1
  while B >= C:
    if i >= K:
      return False
      sys.exit()
    C *= 2
    i += 1
  return True
 

A, B, C = map(int, input().split())
K = int(input())
if(hantei(A, B, C, K)):
  print('Yes')
else:
  print('No')

Solution (Python):
red, green, blue = map(int, input().split())
K = int(input())

for i in range(K):
    if red >= green:
        green = green * 2
    elif green >= blue:
        blue = blue * 2

if red < green and green < blue:
    print('Yes')
else:
    print('No')

Solution (Python):
import math

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

X0 = math.log2(B/A)
Y0 = math.log2(C/B)

def get_num(x):
    if x<=0:
        return int(-x) + 1
    else:
        return 0

n = get_num(X0)
Y_ = Y0 - n
m = get_num(Y_)


print("Yes" if n+m <= K else "No")

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

A = int(s[0])
B = int(s[1])
C = int(s[2])

K = int(input())

result = False

for i in range(K+1):
  if A < B * (2 ** i):
    if (B * (2 ** i)) < C * (2 ** (K - i)):
      result = True
      break
    
if result:
  print('Yes')
else:
  print('No')

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

for _ in range(K):
    if A >= B:
        B = B * 2
    elif B >= C:
        C = C * 2

if A < B and B < C:
    print('Yes')
else:
    print('No')

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

if a<b and b<c:
  print("Yes")

else:
  while k != 0:
    if a >= b:
      b *= 2
      k -= 1
    else:
      c *= 2
      k -= 1
  
  if a<b and b<c:
    print("Yes")
  else:
    print("No")

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

count = 0

while count <= k:
    if a < b and b < c:
        break
    if a >= b:
        count+=1
        b*=2
    elif b >= c:
        count+=1
        c*=2
if a < b and b < c and count <= k:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c= map(int,input().split())
k = int(input())
for i in range(k):
    if b <= a :
        b *= 2
    elif c <= b:
        c *= 2
if b > a and c > b:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = map(int, input().split())
k = int(input())
count=0
while b<=a:
  b*=2
  count+=1
  
while c<=b:
  c*=2
  count+=1
  
if count>k:
  print("No")
else:
  print("Yes")

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

for i in range(1,len(li)):
    while li[i] <= li[i-1] and k:
        li[i] = li[i]*2
        k-=1
for i in range(1,len(li)):
    if li[i] <= li[i-1]:
        print('No')
        break
else:
    print('Yes')

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

while(a[0] >= a[1]):
    a[1] *= 2
    b -= 1
    if b <= 0:
        break
while(a[1] >= a[2]):
    a[2] *= 2
    b -= 1
    if b <= 0:
        break
if a[0] < a[1] and a[1] < a[2] and b >= 0:
    print("Yes")
else:
    print("No")

Solution (Python):
def main():
    a, b, c = map(int, input().split())
    k = int(input())
    cnt = 0
    while(1):
        
        
        
        
        if cnt-1 == k:
            print('No')
            return
        cnt += 1
        if a < b and b < c:
            print('Yes')
            return
        if not a < b:
            b = 2*b
        elif not b < c:
            c = 2*c
if __name__ == '__main__':
    main()

Solution (Python):
import math

def main():
    R,G,B=map(int,input().split())
    K=int(input())

    
    res=0

    if G<=R:
        m=R/G
        n=int(math.log2(m))+1
        res+=n
        G=G*pow(2,n)
        if B<=G:
            m=G/B
            n=int(math.log2(m))+1
            res+=n
    elif B<=G:
        m=G/B
        n=int(math.log2(m))+1
        res+=n

    if res<=K:
        print("Yes")
    else:
        print("No")


if __name__=="__main__":
    main()

Solution (Python):
a,b,c=map(int,input().split())
k=int(input())
cnt=0
while a>=b:
  b=b*2
  cnt+=1

while b>=c:
  cnt+=1
  c=c*2
if cnt<=k:
  print("Yes")
else:
  print("No")

Solution (Python):
from math import floor,ceil,sqrt,factorial,log
from collections import Counter, deque
from functools import reduce
import numpy as np
import itertools
def S(): return input()
def I(): return int(input())
def MS(): return map(str,input().split())
def MI(): return map(int,input().split())
def FLI(): return [int(i) for i in input().split()]
def LS(): return list(MS())
def LI(): return list(MI())
def LLS(): return [list(map(str, l.split() )) for l in input()]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def LLSN(n: int): return [LS() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]

A,B,C = MI()
K = I()

ans = False

def check(a,b,c):
    return a < b and b < c

for i in range(K):
    if A >= B:
        B = B * 2
    elif B >= C:
        C = C * 2
    if check(A,B,C):
        print("Yes")
        exit() 

print("No")

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

k = 0

for i in range(q+1):
    for j in range(0, q-i+1):
        B_ = B * (2 ** i)
        C_ = C * (2 ** j)
        if A < B_ and B_ < C_ and A < C_:
            k = 1
if k != 0:
    print('Yes')
else:
    print('No')

Solution (Python):
from sys import exit
import math
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

a,b,c = mi()
k=ii()

for i in range(k):
    if b <= a:
        b*=2
    elif c <= b:
        c *= 2

    if(a < b and b < c):
        print("Yes")
        exit()
print("No")

Solution (Python):


def main():
    a, b, c = map(int, input().split())
    k = int(input())
    cnt = 0

    while a >= b:
        b *= 2
        cnt += 1
    while b >= c:
        c *= 2
        cnt += 1

    if cnt <= k:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()

Solution (Python):
cards = [int(i) for i in input().split(" ")]

A = cards[0]
B = cards[1]
C = cards[2]

K = int(input())
beyondA = 0
beyondB = 0

while A >= B:
    B *= 2
    beyondA += 1

while B >= C:
    C *= 2
    beyondB += 1

if K < beyondA + beyondB:
    print("No")
else:
    print("Yes")

Solution (Python):



RGB_ = list(map(int, input().split()))
K = int(input())

from itertools import product
L = list(product(range(3), repeat=K))
for l in L:
    RGB=RGB_[:]
    for i in l:
        RGB[i] = RGB[i]*2
        if RGB[2]>RGB[1]>RGB[0]:
            print('Yes')
            exit()
print('No')

Solution (Python):
a,b,c=map(int,input().split())
k=int(input())
r=a//b

for i in range(k):
    if b<=a:
        b=b*2
    else:
        c=c*2

if c>b and b>a:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c=map(int,input().split())
k=int(input())
for i in range(k):
    if(a>=b):
        b=b*2
    elif(b>=c):
        c=c*2
if(a<b and b<c):
    print("Yes")
else:
    print("No")

Solution (Python):

a,b,c=map(int,input().split())
k=int(input())
f=0
if a<b<c:
  print('Yes')
  f=1
t=0
while(b<=a):
  b*=2
  t+=1
while(c<=b):
  c*=2
  t+=1
if t<=k and f==0:
  print('Yes')
  f=1
if f==0:print('No')

Solution (Python):
a,b,c = map(int,input().split())
k = int(input())
for i in range(k):
  if a >= b:
    b = b*2
  elif b >= c:
    c = c*2
if a < b and b < c:
  print('Yes')
else:
  print('No')

Solution (Python):
a, b, c = list(map(int, input().split()))
k = int(input())
 
ans = False
 
for i in range(k):
    if c <= b:
        c *= 2
    elif b <= a:
        b *= 2
    else:
        ans = True
        break
if c > b and b > a:
    ans = True

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

Solution (Python):
a,b,c = map(int, input().split())
k = int(input())
t = 0
while(a>=b):
  b = 2*b
  t +=1
while(b>=c):
  c = 2*c
  t +=1
if(t<=k):
  print("Yes")
else:
  print("No")

Solution (Python):





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

k = 0
while B<=A:
    B*=2
    k += 1

while C<=B:
    C*=2
    k+=1
    
if k<=K:
    print("Yes")
else:
    print("No")

Solution (Python):
R, G, B = map(int, input().strip().split(" "))
K = int(input())
k = 0
while (k < K):
    if (G <= R):
        G *= 2
    elif (B <= G):
        B *= 2
    k += 1
if (B > G and G > R):
    print("Yes")
else:
    print("No")

Solution (Python):

import sys
rl = sys.stdin.buffer.readline

A, B, C = map(int, rl().split())
K = int(rl())

b = 0
for k in range(K):
  if A < (B * (2 ** k)):
    b = k
    break

c = K - b
vb = B * (2 ** b)
vc = C * (2 ** c)

print('Yes' if A < vb and vb < vc else 'No')

Solution (Python):
R,G,B=map(int,input().split())
K=int(input())
cnt=0
while cnt<K:
    if R>=G:
        G*=2
        cnt+=1
    else:
        B*=2
        cnt+=1
if R<G<B:
    print('Yes')
else:
    print('No')

Solution (Python):

def main():
    a,b,c = list(map(int, input().split()))
    k = int(input())
    
    for i in range (k):
        if b <= a:
            b = b*2
        elif c <= b:
            c = c*2
    
    if a < b and b < c:
        print("Yes")
    else:  
        print("No")
   
if __name__ == "__main__":
    main()

Solution (Python):
def inN():
    return int(input())
def inL():
    return list(map(int,input().split()))
def inNL(n):
    return [input().split() for i in range(n)]
import math
a,b,c = inL()
k = inN()
for i in range(k):
    if a >= b:
        b *= 2
    else:
        if b>=c:
            c *= 2

if a < b and b < c :
    print('Yes')
else:
    print('No')

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

for i in range(k):
    if a >= b:
        b = b * 2
        continue
    if a < b and b >= c:
        c = c * 2
if a < b and b < c:
    print("Yes")
else:
    print("No")

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

if b <= a:
    while k > 0:
        b *= 2
        k -= 1
        if b > a:
            break

if c <= b:
    while k > 0:
        c *= 2
        k -= 1
        if c > b:
            break

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

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

cnt= 0
while B <= A:
    B =2* B
    cnt += 1
while C <= B:
    C = 2*C
    cnt += 1

if cnt > K:
    print('No')
else:
    print('Yes')

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

Solution (Python):
import math
import collections
import bisect
from collections import deque
from copy import copy, deepcopy


def main():
    A, B, C = map(int, input().split())
    K = int(input())
    ans = 0
    tmp1 = math.ceil(math.log2((A + 0.1) / B))
    if tmp1 > 0:
        B = B * (2**tmp1)
        ans += tmp1
    tmp2 = math.ceil(math.log2((B + 0.1) / C))
    if tmp2 > 0:
        ans += tmp2
    
    if ans <= K:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

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

for i in range(K):
    if B <= A:
        B *= 2
    elif C <= B:
        C *= 2
    
    if A < B and B < C:
        break

if (A < B and B < C):
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c = map(int,input().split())
k = int(input())
count = 0
for i in range(k):
    if b <= a:
        b = b * 2
        count += 1
    elif a < b and c <= b:
        c = c * 2
        count += 1
    if count == k:
        break

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

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

for i in range(k):
    if b <= a:
        b *= 2
    else:
        c *= 2

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

Solution (Python):
a, b, c = map(int, input().split())
K = int(input())
k = 0
while a >= b:
    b *= 2
    k += 1
while b >= c:
    c *= 2
    k += 1
if k<=K:
    print("Yes")
else:
    print("No")

Solution (Python):
def read():
    A, B, C = map(int, input().split())
    K = int(input().strip())
    return A, B, C, K

def solve(A, B, C, K):
    k = 0
    while A >= B:
        B *= 2
        k += 1
    while B >= C:
        C *= 2
        k += 1
    return "Yes" if k <= K else "No"


if __name__ == '__main__':
    inputs = read()
    print("%s" % solve(*inputs))

Solution (Python):
import sys

r, g, b = map(int, sys.stdin.readline().split())
k = int(sys.stdin.readline())

for i in range(k):
    if not r < g:
        g *= 2
    elif not g < b:
        b *= 2

if r < g and g < b:
    print("Yes")
else:
    print("No")

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

result = 0

for i in range(k):
    if b >= c:
        c=c*2
    elif a >= b:
        b=b*2

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

Solution (Python):
import os
import heapq
import sys
import math
import bisect
import operator
from collections import defaultdict
from io import BytesIO, IOBase
def gcd(a,b):
    if b==0:

        return a
    else:
        return gcd(b,a%b)
def power(x, p,m):
    res = 1
    while p:
        if p & 1:
            res = (res * x) % m
        x = (x * x) % m
        p >>= 1
    return res
def inar():
    return [int(k) for k in input().split()]









def lcm(num1,num2):
    return (num1*num2)//gcd(num1,num2)

def main():
    
    
    a,b,c=map(int,input().split())
    k=int(input())
    counter=0
    while 1:
        if a<b<c or k==0:
            break
        if a>=b and k>0:
            b=b*2
            k-=1
            continue
        if b>=c and k>0:
            c=c*2
            k-=1
            continue
    if a<b<c:
        print("Yes")
    else:
        print("No")













BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

if __name__ == "__main__":
    main()

Solution (Python):
import sys
import math
sys.setrecursionlimit(int(1e6))

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



while(k>0):
  if (b > a) and (c > b):
    print('Yes')
    break

  if (b > a):
    c = 2 * c
  else:
    b = 2 * b

  k = k - 1
else:
  if (b > a) and (c > b):
    print('Yes')
  else:
    print('No')

Solution (Python):

if __name__ == "__main__":
    A, B, C = map(int, input().split())
    K = int(input())

    for i in range(K):
        if B <= A:
            B *= 2
        elif C <= A:
            C *= 2
        elif C <= B:
            C *= 2

    if A < B < C:
        print("Yes")
    else:
        print("No")

Solution (Python):

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

ans='No'
for k in range(K+1):
    k_b=k
    k_c=K-k
    
    if A < B*(2**k_b) and B*(2**k_b) < C*(2**k_c):
        ans='Yes'
    
print(ans)

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

for ai in range(k):
  for bi in range(k):
    if ai + bi > k:
      continue
    ci = k - (ai+bi)
    tmpa = a * (2 ** ai)
    tmpb = b * (2 ** bi)
    tmpc = c * (2 ** ci)
    if tmpa < tmpb and tmpb < tmpc:
      print('Yes')
      exit(0)
print('No')

Solution (Python):
import copy
import itertools
r,g, b = map(int,input().split())
k = int(input())


lst = [r,g,b]
for v in itertools.product([0,1,2], repeat=k):
    tmplst = copy.deepcopy(lst)
    for i in v:
        tmplst[i] *= 2
    if tmplst[0] < tmplst[1] < tmplst[2]:
        print('Yes')
        exit()
print('No')

Solution (Python):
import sys












stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18

def solve():
    A, B, C = map(int, stdin.readline().rstrip().split())
    k = int(stdin.readline().rstrip())
    for i in range(k):
        if C > B > A:
            print("Yes")
            exit()
        elif B >= C or A >= C:
            C = C*2
        elif A >= B:
            B = B*2
    if C > B >A:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    solve()

Solution (Python):

def main():
    A, B, C = (int(x) for x in input().split(" "))
    K = int(input())
    for i in range(K):
        if A < B:
            if B < C:
                print("Yes")
                exit()
            C = 2*C
        else:
            B = 2*B

    if A < B and B < C:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

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

for i in range(k):
	if a >= b:
		b *= 2
	elif b >= c:
		c *= 2

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

Solution (Python):
A, B, C = map(lambda x:int(x), input().split(' '))
K = int(input())
count = 0
while count < K:
    if A >= B:
        B *= 2
        count+=1
    elif B >= C:
        C *= 2
        count+=1
    else:
        break
if A < B < C:
    print('Yes')
else:
    print('No')

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

cnt = 0
while A >= B:
    B *= 2
    cnt += 1

while B >= C:
    C *= 2
    cnt += 1

if cnt <= K:
    print("Yes")
else:
    print("No")

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

while(K > 0 and A >= B):
    K-=1
    B = B*2


while(K > 0 and B >= C):
    K-=1
    C = C*2

if( A < B and B < C):
    print("Yes")
else:
    print("No")

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

for i in range(K):
    if A < B < C:
        print("Yes")
        exit()
    elif A <= C <= B:
        C *= 2
    elif B <= A <= C:
        B *= 2
    elif B <= C <= A:
        C *= 2
    elif C <= A <= B:
        C *= 2
    elif C <= B <= A:
        C *= 2

if A < B < C:
    print("Yes")
else:
    print("No")