#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)
#define all(a) (a).begin(),(a).end()

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    
    int N, K;
    cin >> N >> K;
    
    vector<int> dist(N + 1, -1);
    queue<int> que;
    dist[1] = 1;
    que.push(1);
    
    while (!que.empty()) {
        int M = que.front();
        que.pop();
        
        if (2 * M <= N) {
            if (dist[2 * M] == -1) {
                dist[2 * M] = dist[M] + 1;
                que.push(2 * M);
            }
        }
        
        if (M + 3 <= N) {
            if (dist[M + 3] == -1) {
                dist[M + 3] = dist[M] + 1;
                que.push(M + 3);
            }
        }
    }
    
    if (dist[N] == -1 || dist[N] > K) cout << "NO\n";
    else cout << "YES\n";
}