#include <iostream>
#include <queue>
using namespace std;

int main()
{
    int n, k;
    cin >> n >> k;
    queue<int> que;
    int d[200005];
    for(int i = 1; i < n; i++) d[i] = -1;
    d[n] = 0;
    que.push(n);
    while(que.size()){
        int u = que.front();
        que.pop();
        if(u % 2 == 0 && d[u / 2] == -1){
            d[u / 2] = d[u] + 1;
            que.push(u / 2);
        }
        if(u - 3 >= 1 && d[u - 3] == -1){
            d[u - 3] = d[u] + 1;
            que.push(u - 3);
        }
    }
    if(d[1] == -1 || d[1] > k) cout << "NO" << endl;
    else cout << "YES" << endl;
}