#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int dp[400040];
int main() {
	int n, k;
	cin >> n >> k;
	for (int i = 1; i <= 2 * n; i++) {
		dp[i] = 1000000007;
	}
	dp[1] = 0;
	for (int i = 1; i <= n; i++) {
		dp[i + 3] = min(dp[i + 3], dp[i] + 1);
		dp[i * 2] = min(dp[i * 2], dp[i] + 1);
	}
	if (dp[n] <= k) {
		cout << "YES" << endl;
	}
	else {
		cout << "NO" << endl;
	}
}