from collections import deque

n,k = map(int,input().split())

chk = [0]*(n+1)

d = deque()
d.appendleft(1)

for i in range(k+1):
    for j in range(len(d)):
        tmp = d.popleft()
        if chk[tmp] == 0:
            if tmp*2 <= n:
                d.appendleft(tmp*2)
            if tmp+3 <= n:
                d.appendleft(tmp+3)
            chk[tmp] = 1

if chk[n] == 0:
    print("NO")
else:
    print("YES")