import heapq
from collections import deque
N,K = map(int,input().split())
Visited = [0]*(N+1)
Visited[1] = 0
que = [1]
G = {1:[]}
while que:
    x = heapq.heappop(que)
    if Visited[x]==1:continue
    Visited[x] = 1
    y = 2*x
    if y<=N and Visited[y]==0:
        heapq.heappush(que,y)
        G[y] = []
        G[x].append(y)
    y = x+3
    if y<=N and Visited[y]==0:
        heapq.heappush(que,y)
        G[y] = []
        G[x].append(y)
dist = [-1]*(N+1)
dist[1] = 0
que = deque([1])
while que:
    x = que.popleft()
    for y in G[x]:
        if dist[y]==-1:
            dist[y] = dist[x]+1
            que.append(y)
if dist[N]==-1 or dist[N]>K:
    print("NO")
else:
    print("YES")