#include "bits/stdc++.h"

#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cerr<<v[i]<<" "
#define fi first
#define se second

using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct edge{ll x, c;};


ll N, K;
llvec dp;

ll dpf(ll n){
  if(n<=0)return 1e18;
  if(n==1)return 0;
  if(dp[n]>=1e18){

  }else{
    if(n%2==0){
      dp[n] = min(dp[n], dpf(n/2)+1);
    }else{
      dp[n] = min(dp[n], dpf((n-3)/2)+2);
    }
    dp[n] = min(dp[n], dpf(n-3)+1);
  }
  return dp[n];
}

/**************************************
** A main function starts from here  **
***************************************/
int main(){
  cin >> N >> K;
  dp = llvec(N+1, 1e18);
  ll t = dpf(N);
  if(t<=K){
    cout << "YES"<<endl;
  }else{
    cout << "NO" << endl;
  }
  return 0;
}