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

int main(){
    int n, k;
    cin >> n >> k;
    vector<int> cost(n*2+10, -1);
    queue<int> Q;
    Q.push(1);
    cost[1] = 0;
    while(Q.size()){
        int cur = Q.front(); Q.pop();
        if(cur >= n) break;
        if(cost[cur+3] == -1){
            cost[cur+3] = cost[cur]+1;
            Q.push(cur+3);
        }
        if(cost[cur*2] == -1){
            cost[cur*2] = cost[cur]+1;
            Q.push(cur*2);
        }
    }

    if(cost[n] != -1 && cost[n] <= k) cout << "YES";
    else cout << "NO";
    cout << endl;
    return 0;
}