def chmax(DP,i,v):
    if DP[i] < v: DP[i] = v
def chmin(DP,i,v):
    if DP[i] > v: DP[i] = v

N, K = map(int, input().split())
dp = [K + 1]*(N + 1)
dp[1] = 0
for i in range(1, N):
    # i + 3
    # 2*i
    if i + 3 <= N:
        chmin(dp, i + 3, dp[i] + 1)
    if 2*i <= N:
        chmin(dp, 2*i, dp[i] + 1)

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