#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000001

int main(){
	
	long long N,K;
	cin>>N>>K;
	
	vector<int> dp(N+1,Inf);
	dp[1] = 0;
	rep(i,N){
		if(dp[i]==Inf)continue;
		if(i+3<=N)dp[i+3] = min(dp[i+3],dp[i]+1);
		if(i*2<=N)dp[i*2] = min(dp[i*2],dp[i]+1);
	}
	
	if(dp.back()<=K)cout<<"YES"<<endl;
	else cout<<"NO"<<endl;
	
    return 0;
}