#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N, K;
	cin >> N >> K;
	vector<int> dp(N + 1, INF);
	dp[1] = 0;
	
	auto solve = [&](auto self, int n) -> int {
		int & res = dp[n];
		if (n == 0 || res != INF) return res;
		if (n >= 3) chmin(res, self(self, n - 3) + 1);
		if (~n & 1) chmin(res, self(self, n / 2) + 1);
		return res;
	};
	
	puts(solve(solve, N) <= K ? "YES" : "NO");
}