#include <bits/stdc++.h>
using namespace std;
using ll = long long;
 
map<ll, ll> memo;
 
ll solve(ll y){
  if(memo.find(y) != memo.end()) return memo[y];
  if(y==1) return memo[1] = 0;
  if(y%2==1 && y!=3) return memo[y] = min(solve(y-3),solve((y-3)/2)+2);
  if(y%2==0) return memo[y] = solve(y/2)+1;
  if(y==3) return memo[y] = 1e9;
}
 
int main(){
  int x, k; cin >> x >> k;
  int m = solve(x);
  if(m<=k) cout << "YES" << endl;
  else cout << "NO" << endl;
  return 0;
}