#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
// constexpr int mod = 1000000007;
constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

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

    int N, K;
    cin >> N >> K;

    vector<int> lb(N + 1, INF), ub(N + 1, -INF);
    lb[N] = ub[N] = 0;
    for(int i = N; i > 1; --i){
        if(i % 2 == 0){
            chmin(lb[i / 2], lb[i] + 1);
            chmax(ub[i / 2], ub[i] + 1);
        }
        if(i - 3 > 0){
            chmin(lb[i - 3], lb[i] + 1);
            chmax(ub[i - 3], ub[i] + 1);
        }
    }
    
    if(lb[1] <= K && K <= ub[1])    cout << "YES\n";
    else    cout << "NO\n";

    return 0;
}