N, K = gets.split.map(&:to_i)
dist = [nil, 0]
queue = [1]
until queue.empty?
    x = queue.shift
    d = dist[x]
    [x * 2, x + 3].each do |y|
        if y <= N and (!dist[y] or dist[y] > d + 1)
            dist[y] = d + 1
            queue << y
        end
    end
end

if dist[N] and dist[N] <= K
    puts "YES"
else
    puts "NO"
end