#include <iostream>
#include <vector>

using namespace std;

void solve() {
    int n, k;
    cin >> n >> k;

    vector<int> dp(n + 1, k + 1);
    dp[n] = 0;

    for (int i = n - 1; i >= 1; --i) {
        if (i * 2 <= n) dp[i] = min(dp[i], dp[i * 2] + 1);
        if (i + 3 <= n) dp[i] = min(dp[i], dp[i + 3] + 1);
    }

    cout << (dp[1] <= k ? "YES" : "NO") << "\n";
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    solve();

    return 0;
}