#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define int ll
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define ALL(a) (a).begin(), (a).end()
template <class t, class u> void chmax(t& a, u b) {
    if (a < b) a = b;
}
template <class t, class u> void chmin(t& a, u b) {
    if (b < a) a = b;
}
template <class t> using vc = vector<t>;
template <class t> using vvc = vc<vc<t>>;
using pi = pair<int, int>;
using vi = vc<int>;
using uint = unsigned;
using ull = unsigned long long;
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
ll mask(int i) { return (ll(1) << i) - 1; }
int lcm(int a, int b) { return a / __gcd(a, b) * b; }
vvc<int> g(200200);
signed main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(20);
    int n, k;
    cin >> n >> k;
    const int inf = 1LL << 60;
    vc<int> dp(n + 1, inf);
    queue<int> Q;
    Q.push(n);
    dp[n] = 0;
    while (!Q.empty()) {
        auto p = Q.front();
        Q.pop();
        if (p - 3 > 0 && dp[p - 3] == inf) {
            Q.push(p - 3);
        }
        if (p % 2 == 0 && dp[p / 2] == inf) {
            Q.push(p / 2);
        }
    }
    if (dp[n] <= k) {
        cout << "YES" << endl;
    } else {
        cout << "NO" << endl;
    }
}