using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, k) = (c[0], c[1]);
        var tree = new List<int>[n + 1];
        for (var i = 0; i < tree.Length; ++i) tree[i] = new List<int>();
        for (var i = 1; i < n; ++i)
        {
            if (i + 3 <= n) tree[i].Add(i + 3);
            if (i * 2 <= n) tree[i].Add(i * 2);
        }
        var len = Enumerable.Repeat(n * 2, n + 1).ToArray();
        len[1] = 0;
        var q = new Queue<int>();
        q.Enqueue(1);
        while (q.Count > 0)
        {
            var cur = q.Dequeue();
            foreach (var next in tree[cur])
            {
                if (len[next] <= len[cur] + 1) continue;
                len[next] = len[cur] + 1;
                q.Enqueue(next);
            }
        }
        WriteLine(len[n] <= k ? "YES" : "NO");
    }
}