import java.util.LinkedList

fun main(args: Array<String>) {
    val (n,k) = readLine()!!.split(" ").map { it.toInt() }
    val stetps = arrayOfNulls<Int>(n+1)
    val queue = LinkedList<Int>()
    queue.add(1)
    stetps[1] = 0
    while (queue.isNotEmpty()) {
        val cur = queue.pop()
        val nextStep = stetps[cur]!! + 1
        val nextList = listOf(cur*2, cur+3).filter { it <= n }
        for(next in nextList) {
            if(stetps[next] == null || stetps[next]!! > nextStep) {
                stetps[next] = nextStep
                queue.add(next)
            }
        }
    }
    println(if((stetps[n] ?: (k + 1)) > k) "NO" else "YES")
}