#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

int N,K;
vector<int> D;

int main(){
  cin>>N>>K;
  D.assign(N+1,-1);
  queue<int> Q;
  D[1]=0; Q.push(1);
  while(Q.size()){
    int p=Q.front(); Q.pop();
    if(D[p]==K) continue;
    if(p*2<=N) if(D[p*2]==-1){ D[p*2]=D[p]+1; Q.push(p*2); }
    if(p+3<=N) if(D[p+3]==-1){ D[p+3]=D[p]+1; Q.push(p+3); }
  }
  if(D[N]==-1) cout<<"NO\n";
  else cout<<"YES\n";
  return 0;
}