#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
 
#define rep(i, init, end) for(ll i = init; i < end; i++)
#define REP(i, init, end) for(ll i = init; i < end + 1; i++)
#define rev(i, end, init) for(ll i = init - 1; i >= end; i--)
#define REV(i, end, init) for(ll i = init; i >= end; i--)
#define PI 3.14159265359
#define EPS 0.0000000001
#define MOD 1000000007
//cout << std::fixed << std::setprecision(15) << y << endl;
 

int main(){
    ll N, K;
    cin >> N >> K;

    ll dp[3 * N + 1];
    dp[1] = 0;
    REP(i, 2, N){
        dp[i] = K + 1;
    }
    REP(i, 1, N){
        dp[i + 3] = min(dp[i] + 1, dp[i + 3]);
        dp[i * 2] = min(dp[i] + 1, dp[i * 2]);
    }

    if(dp[N] <= K){
        cout << "YES" << endl;
    }else{
        cout << "NO" << endl;
    }

    return 0;
}