INF = 10**18
from collections import deque
N, K = map(int, input().split())
dist = [INF]*(N + 1)
dist[1] = 0
que = deque([1])
while que:
    pos = que.popleft()
    for nex in [pos + 3, 2*pos]:
        if nex > N:
            continue
        if dist[nex] == INF:
            dist[nex] = dist[pos] + 1
            que.append(nex)

if dist[-1] <= K:
    print('YES')
else:
    print('NO')