#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;

int main() {
  int n, k;
  cin >> n >> k;
  vector<int> dp(n+1, -1);
  dp.at(1) = k;
  rep2(i, 1, dp.size()) {
    int nx = i*2;
    if(nx < dp.size()) dp.at(nx) = max(dp.at(nx), dp.at(i)-1);
    nx = i+3;
    if(nx < dp.size()) dp.at(nx) = max(dp.at(nx), dp.at(i)-1);
  }
  // rep(i, dp.size()) cerr << dp.at(i) << " ";
  // cerr << endl;
  if(dp.back() >= 0) cout << "YES" << endl;
  else cout << "NO" << endl;
  return 0;
}