#include using namespace std; #define ll long long #define rep(i, m, n) for (ll i = m; i < n; i++) #define rrep(i, m, n) for (ll i = m - 1; i >= n; i--) #define pb(n) push_back(n) #define UE(N) N.erase(unique(N.begin(), N.end()), N.end()); #define Sort(n) sort(n.begin(), n.end()) #define Rev(n) reverse(n.begin(), n.end()) #define HOUT(S) cout << setprecision(50) << S << endl #define pint pair #define paf(L, R) pair #define mod 1000000007 #define MAX 10000010 #define endl "\n" #define ALL(a) a.begin(), a.end() #define chmax(a, b) a = (((a) < (b)) ? (b) : (a)) #define chmin(a, b) a = (((a) > (b)) ? (b) : (a)) template vector make_v(size_t a) { return vector(a); } template auto make_v(size_t a, Ts... ts) { return vector(ts...))>(a, make_v(ts...)); } template typename enable_if::value != 0>::type fill_v(U& u, const V... v) { u = U(v...); } template typename enable_if::value == 0>::type fill_v(U& u, const V... v) { for (auto& e : u) fill_v(e, v...); } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); ll N, K; cin >> N >> K; vector dist(N + 1, mod); priority_queue, greater> pque; dist[1] = 0; pque.push(pint(1, 0)); while(!pque.empty()) { auto v = pque.top(); pque.pop(); if(min(dist[v.first], K - 1) < v.second) continue; if(v.first * 2 <= N) { if(v.second + 1 < dist[v.first * 2]) { dist[v.first * 2] = v.second + 1; pque.push(pint(v.first * 2, v.second + 1)); } } if(v.first + 3 <= N) { if(v.second + 1 < dist[v.first + 3]) { dist[v.first + 3] = v.second + 1; pque.push(pint(v.first + 3, v.second + 1)); } } } if(dist[N] <= K) cout << "YES" << endl; else cout << "NO" << endl; }