#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(const char c[]){
  int i=0;
  for(i=0;c[i]!='\0';i++){
    my_putchar_unlocked(c[i]);
  }
}
template<class S, class T> inline S chmin(S &a, T b){
  if(a>b){
    a=b;
  }
  return a;
}
int N;
int K;
int dp[200000+1];
int main(){
  int i;
  rd(N);
  rd(K);
  for(i=(0);i<(200000+1);i++){
    dp[i] = 1073709056;
  }
  dp[1] = 1;
  for(i=(0);i<(200000+1);i++){
    if(i + 3 <= 200000){
      chmin(dp[i+3], dp[i] + 1);
    }
    if(2 * i <= 200000){
      chmin(dp[2*i], dp[i] + 1);
    }
  }
  if(dp[N] <= K){
    wt_L("YES");
    wt_L('\n');
  }
  else{
    wt_L("NO");
    wt_L('\n');
  }
  return 0;
}
// cLay version 20210328-1 [beta]

// --- original code ---
// int N, K;
// int dp[2d5+1];
// {
//   rd(N,K);
//   rep(i,2d5+1) dp[i] = int_inf;
//   dp[1] = 1;
//   rep(i,2d5+1){
//     if(i + 3 <= 2d5) dp[i+3] <?= dp[i] + 1;
//     if(2 * i <= 2d5) dp[2*i] <?= dp[i] + 1;
//   }
//   wt(if[dp[N] <= K, "YES", "NO"]);
// }