import sys
from collections import defaultdict
sys.setrecursionlimit(1000000)
def bfs(n,k):
    if n==1:
        print('YES')
        exit()
    if n<=0 or k<=0:
        return
    if d[n]==1:
        return
    d[n]=1
    bfs(n-3,k-1)
    if n%2==0:
        bfs(n//2,k-1)





N,K = map(int,input().split())
d = defaultdict(lambda: 0)

bfs(N,K)
print('NO')