#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int N, K;
	cin >> N >> K;
	vector<int>D(N + 1, INF);
	queue<pair<int, int>> q;
	D[1] = 0;
	q.emplace(D[1], 1);
	while (!q.empty()) {
		int dist = q.front().first;
		int pos = q.front().second;
		q.pop();
		int next = pos + 3;
		if ((next <= N) && (D[next] > (D[pos] + 1))) {
			D[next] = D[pos] + 1;
			q.emplace(D[next], next);
		}
		next = pos * 2;
		if ((next <= N) && (D[next] > (D[pos] + 1))) {
			D[next] = D[pos] + 1;
			q.emplace(D[next], next);
		}
	}
	if (D[N] <= K) {
		cout << "YES" << endl;
	}
	else {
		cout << "NO" << endl;
	}
	return 0;
}