#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int n, k;
    cin >> n >> k;
    vector<int> d(n+1, INF<int>);
    d[1] = 0;
    for (int i = 0; i < n; ++i) {
        if(i+3 <= n) d[i+3] = min(d[i+3], d[i]+1);
        if(i*2 <= n) d[i*2] = min(d[i*2], d[i]+1);
    }
    puts(d[n] <= k ? "YES" : "NO");
    return 0;
}