#include <bits/stdc++.h>
using namespace std;
const int INF = 10000000;
int main(){
  int N, K;
  cin >> N >> K;
  vector<int> dp(N + 1, INF);
  dp[1] = 0;
  for (int i = 1; i <= N; i++){
    if (i * 2 <= N){
      dp[i * 2] = min(dp[i * 2], dp[i] + 1);
    }
    if (i + 3 <= N){
      dp[i + 3] = min(dp[i + 3], dp[i] + 1);
    }
  }
  if (dp[N] <= K){
    cout << "YES" << endl;
  } else {
    cout << "NO" << endl;
  }
}