#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------


int N,K;
int dp[202020];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>K;
	FOR(i,N+1) dp[i]=1010101;
	queue<int> Q;
	dp[1]=0;
	Q.push(1);
	while(Q.size()) {
		int cur=Q.front();
		Q.pop();
		if(dp[cur]>K) break;
		if(cur==N) {
			cout<<"YES"<<endl;
			return;
		}
		
		if(cur*2<=N&&dp[cur*2]>dp[cur]+1) {
			dp[cur*2]=dp[cur]+1;
			Q.push(cur*2);
		}
		if(cur+3<=N&&dp[cur+3]>dp[cur]+1) {
			dp[cur+3]=dp[cur]+1;
			Q.push(cur+3);
		}
		
	}
	cout<<"NO"<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}