#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> dist(N+1,INF);
  dist[1]=0;
  queue<int> Q;
  Q.push(1);
  while(!Q.empty()){
      int i=Q.front();
      Q.pop();

      if(2*i<=N&&dist[2*i]==INF){
          dist[2*i]=dist[i]+1;
          Q.push(2*i);
      }
      if(i+3<=N&&dist[i+3]==INF){
          dist[i+3]=dist[i]+1;
          Q.push(i+3);
      }
  }

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

  return 0;
}