N, K = map(int, input().split())
from collections import deque
min_cost = [K+1]*(N+1)
min_cost[1] = 0
que = deque([1])
while len(que):
  a = que.popleft()
  if min_cost[a]<K:
    if a*2<=N and min_cost[a*2] > min_cost[a]+1:
      min_cost[a*2] = min_cost[a]+1
      que.append(a*2)
    if a+3<=N and min_cost[a+3] > min_cost[a]+1:
      min_cost[a+3] = min_cost[a]+1
      que.append(a+3)
print('YNEOS'[int(min_cost[N]>K)::2])