#include #define rep(i,n) for(int i=0;i<(int)(n);i++) #define chmin(x,y) x = min((x),(y)) #define chmax(x,y) x = max((x),(y)) #define popcount(x) __builtin_popcount(x) using namespace std; using ll = long long ; using P = pair ; using pll = pair; const int INF = 1e9; const long long LINF = 1e17; //const int MOD = 1000000007; const int MOD = 998244353; const double PI = 3.14159265358979323846; int main(){ int n,k; cin >> n >> k; vector dp(n+1,INF); dp[1] = 0; for(int i=2;i<=n;i++){ if(i-3>=0) dp[i] = dp[i-3]+1; if(i%2==0) dp[i] = dp[i/2]+1; } cout << (dp[n] <= k ? "YES" : "NO") << endl; return 0; }