#include <bits/stdc++.h>
using namespace std;

void fast_io() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
}

int main() {
	fast_io();
	int n, k;
	cin >> n >> k;
	vector<int> dist(n + 1, 1e9);
	dist[1] = 0;
	deque<int> dq;
	dq.push_back(1);
	while (!dq.empty()) {
		int u = dq.front();
		dq.pop_front();
		if (u + 3 <= n) {
			if (dist[u + 3] > dist[u] + 1) {
				dist[u + 3] = dist[u] + 1;
				dq.push_back(u + 3);
			}
		}
		if (2 * u <= n) {
			if (dist[2 * u] > dist[u] + 1) {
				dist[2 * u] = dist[u] + 1;
				dq.push_front(2 * u);
			}
		}
	}
	if (dist[n] <= k) {
		cout << "YES\n";
	} else {
		cout << "NO\n";
	}
}