from collections import deque
N, K = map(int, input().split())

def BFS_dist(n, i0=0):
    Q = deque([i0])
    D = [-1] * n
    D[i0] = 0
    while Q:
        x = Q.popleft()
        if x % 2 == 0:
            c = x // 2
            if c > 0 and D[c] == -1:
                D[c] = D[x] + 1
                Q.append(c)
        if x - 3 > 0:
            c = x - 3
            if c > 0 and D[c] == -1:
                D[c] = D[x] + 1
                Q.append(c)
    return D

D = BFS_dist(N + 1, N)
print("YES" if 0 <= D[1] <= K else "NO")