import sys
input = sys.stdin.readline
from collections import *

def bfs():
    dist = [-1]*(N+1)
    dist[N] = 0
    q = deque([N])
    
    while q:
        v = q.popleft()
        
        if v%2==0:
            if dist[v//2]==-1:
                dist[v//2] = dist[v]+1
                q.append(v//2)
        
        if v>3:
            if dist[v-3]==-1:
                dist[v-3] = dist[v]+1
                q.append(v-3)
    
    if dist[1]==-1:
        return False
        
    return dist[1]<=K

N, K = map(int, input().split())

if bfs():
    print('YES')
else:
    print('NO')