#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

const int F=20;
const int INF=1e9;

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

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

  vector<int> dp(N+1,INF);
  dp[1]=1;
  for(int k=0;k<F;k++){
      vector<int> ndp=dp;
      for(int j=0;j<3;j++){
          int value=INF;
          for(int i=j;i<=N;i+=3){
              chmin(ndp[i],value);

              chmin(value,dp[i]);
              if(value<INF) value++;
          }
      }

      for(int i=1;i<=N;i++){
          int value=i;
          int cnt=0;
          while(value*2<=N){
              value*=2;
              cnt++;
              chmin(ndp[value],dp[i]+cnt);
          }
      }
      swap(dp,ndp);
  }

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

  return 0;
}