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

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n, k;
  cin >> n >> k;
  vector<int> dist(n + 1, 1e9);
  queue<int> q;
  q.push(1);
  dist[1] = 0;
  while (!q.empty()) {
    int v = q.front();
    q.pop();
    for (int u : { 2 * v, v + 3 }) {
      if (u > n) continue;
      if (dist[u] > dist[v] + 1) {
        dist[u] = dist[v] + 1;
        q.push(u);
      }
    }
  }
  cout << (dist[n] <= k ? "YES" : "NO") << '\n';
  return 0;
}