import sys
sys.setrecursionlimit(500000) 
N,K = map(int,input().split()); INF = float("inf")

def solve(n,k):
    if k == 0:
        if n == 1:
            return 1
        else:
            return 0
    if n == 1 and k >= 0:
        return 0
    Flag = 0
    if n > 3:
        Flag |= solve(n-3,k-1)
    if n%2 == 0:
        Flag |= solve(n//2,k-1)
    return Flag
MAX = 5*pow(10,5)
dp = [INF]*(MAX)
dp[1] = 0
for i in range(1,MAX):
    if i > 3 and i%2 == 0:
        dp[i] = min(dp[i-3], dp[i//2]) + 1
    elif i > 3:
        dp[i] = dp[i-3] + 1
    elif i%2 == 0:
        dp[i] = dp[i//2] + 1
#print(dp)
if dp[N] <= K:
    print("YES")
else:
    print("NO")