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

dp = [1e9] * 100010
dp[1] = 0
for i in range(100010):
	if i+3<100010:
		dp[i+3] = min(dp[i+3], dp[i] + 1)
	if i*3<100010:
		dp[i*2] = min(dp[i*2], dp[i] + 1)
print("YNEOS"[dp[n]>k::2])