#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < int(n); ++i)
#define rrep(i,n) for(int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) {a = max(a, b);}
template<class T> void chmin(T& a, const T& b) {a = min(a, b);}
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

constexpr int INF = 1001001001;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, k;
    cin >> n >> k;
    VI dist(n + 1, INF);
    VVI to(n + 1);
    for(int i = 1; i <= n; i++) {
        for(int j: {2 * i, i + 3}) {
            if (j <= n) to[i].push_back(j);
        }
    }
    queue<int> q;
    auto push = [&](int i, int d) {
        if (dist[i] == INF) {
            dist[i] = d;
            q.push(i);
        }
    };
    push(1, 0);
    while(!q.empty()) {
        int i = q.front(); q.pop();
        for(int j: to[i]) push(j, dist[i] + 1);
    }
    cout << (dist[n] <= k ? "YES" : "NO") << '\n';
}