import sys
sys.setrecursionlimit(1000000)
from functools import lru_cache

@lru_cache(maxsize=100000)
def solve(n,k):
  if k==0:
    return n==1
  if n<1:
    return False
  if n==1:
    return True
  
  if n&1:
    return solve(n-3,k-1)
  elif n==4:
    return solve(n-3,k-1) or solve(n//2,k-1)
  elif 6<=n and 2<=k:
    return solve(n//2,k-1) or (k&1 and solve(n//2,(k+1)//2))
  else:
    return solve(n//2,k-1)
n,k=map(int,input().split())
print('YNEOS'[not solve(n,k)::2])