from collections import deque

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

dp = {}
dq = deque()
dq.append(n)
dp[n] = 0
while len(dq) > 0:
  cur = dq.pop()

  nxts = []
  if cur - 3 >= 1:
    nxts.append(cur - 3)
  if cur % 2 == 0:
    nxts.append(cur // 2)

  for nxt in nxts:
    if dp.get(nxt, None) is None:
      dp[nxt] = dp[cur] + 1
      dq.appendleft(nxt)

if dp.get(1, 1 << 60) <= k:
  print("YES")
else:
	print("NO")