#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cassert>
#include<cmath>
#include<ctime>
#include<iomanip>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<bitset>
#include<random>
using namespace std;
int N,K;
int f(int N)
{
	if(N == 1) return 0;
	if(N == 2) return 1;
	if(N == 4) return 1;

	int res = 0,M = 1,r = N%3%2;
	if(r == 1)
	{
		while(M*4 <= N) M *= 4,res += 2;
		assert((N-M)%3 == 0);
		int x = (N-M)%3;
		res += x/M + x%M;
	}
	else
	{
		M *= 2;
		res++;
		while(M*4 <= N) M *= 4,res += 2;
		assert((N-M)%3 == 0);
		int x = (N-M)/3;
		res += x/M + x%M;
	}

	return res;
}
void solve()
{
	cin >> N >> K;
	if(N%3 == 0)
	{
		cout << "NO" << endl;
		return;
	}

	int need = f(N);
	cout << (need <= K ? "YES":"NO") << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	//cin >> tt;
	while(tt--) solve();
}