#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
  int n, k;
  cin >> n >> k;
  vector<vector<int>> dp(n + 10);
  dp[1].push_back(0);
  for(int i = 1; i < n; i++) {
    if(dp[i].size() == 0) {
      continue;
    }
    int tmp = *min_element(dp[i].begin(), dp[i].end());
    if(tmp >= k) {
      continue;
    }
    dp[i + 3].push_back(tmp + 1);
    if(i * 2 <= n) {
      dp[i * 2].push_back(tmp + 1);
    }
  }
  if(dp[n].size() > 0) {
    cout << "YES\n";
  } else {
    cout << "NO\n";
  }
  return 0;
}