#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){

    int N, K, x;
    cin >> N >> K;
    vector<int> dist(N+1, 1e9);
    dist[1] = 0;
    queue<int> que;
    que.push(1);

    while(!que.empty()){
        x = que.front();
        que.pop();
        if (x*2 <= N && dist[x*2] == 1e9){
            dist[x*2] = dist[x]+1;
            que.push(x*2);
        }
        if (x+3 <= N && dist[x+3] == 1e9){
            dist[x+3] = dist[x]+1;
            que.push(x+3);
        }
    }

    cout << (dist[N] <= K ? "YES" : "NO") << endl;

    return 0;
}