#include using namespace std; using i64 = int64_t; using pii = pair; #define rep(i, n) for (i64 i = 0; i < (i64) n; i++) #define per(i, n) for (i64 i = n - 1; i >= 0; i--) #define REP(i, a, b) for (i64 i = a; i < (i64) b; i++) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define fi first #define se second #ifdef LOCAL #define dbg(...) cerr<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debug(__VA_ARGS__) #else #define dbg(...) #endif template ostream& operator<<(ostream& os, const vector& vec) { for (auto& x : vec) { os << x << ' '; } return os; } template ostream& operator<<(ostream& os, const vector>& mat) { os << endl; for (auto& vec : mat) { os << vec << endl; } return os; } template ostream& operator<<(ostream& os, const pair& pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; } void debug() { cerr << endl; } template void debug(Head H, Tail... T) { cerr << " " << H; debug(T...); } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } const int INF = (1 << 30) - 1; const i64 LINF = (1LL << 62) - 1; void solve() { int n, k; cin >> n >> k; vector dp(n + 1); queue> que; dp[1] = 1; que.push({1, k}); while(!que.empty()) { int num, rem; tie(num, rem) = que.front(); que.pop(); if (num == n) { cout << "YES" << endl; return; } if (rem == 0) continue; if (num + 3 <= n && !dp[num + 3]) { dp[num + 3] = 1; que.push({num + 3, rem - 1}); } if (num * 2 <= n && !dp[num * 2]) { dp[num *2] = 1; que.push({num * 2, rem - 1}); } } cout << "NO" << endl; } int main() { cin.tie(0); ios::sync_with_stdio(false); solve(); return 0; }