#include<iostream>
#include<queue>
using namespace std;
int dist[2<<17];
int N,K;
main()
{
	cin>>N>>K;
	for(int i=0;i<=N;i++)dist[i]=K+1;
	dist[N]=0;
	queue<int>P;
	P.push(N);
	while(!P.empty())
	{
		int u=P.front();P.pop();
		if(u%2==0&&dist[u/2]>dist[u]+1)
		{
			dist[u/2]=dist[u]+1;
			P.push(u/2);
		}
		if(u>=4&&dist[u-3]>dist[u]+1)
		{
			dist[u-3]=dist[u]+1;
			P.push(u-3);
		}
	}
	cout<<(dist[1]>K?"NO":"YES")<<endl;
}