from collections import deque


n, k = map(int, input().split())
G = [[] for i in range(2 * n + 1)]
for i in range(1, n + 1):
    G[i].append(2 * i)
    G[i].append(i + 3)
d = [-1] * (2 * n + 1)
d[1] = 0
Q = deque([1])
while Q:
    u = Q.popleft()
    for v in G[u]:
        if d[v] == -1:
            d[v] = d[u] + 1
            Q.append(v)
print("YES" if d[n] != -1 and d[n] <= k else "NO")