#include <bits/stdc++.h>
#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<int,int> ;
using pll = pair<long long,long long>;
const int INF = 1e9;
const long long LINF = 1e17;
//const int MOD = 1000000007;
const int MOD = 998244353;
const double PI = 3.14159265358979323846;

map<int,int> memo;

int dfs(int x){
    if(x < 1) return INF;
    if(x == 1) return 0;
    if(x == 3) return INF;
    if(memo.count(x) > 0) return memo[x];
    int res = INF;
    if(x % 2 == 0) res = dfs(x/2)+1;
    else res = dfs(x-3)+1;
    memo[x] = res;
    return res;
}

int main(){
    int n,k;
    cin >> n >> k;
    cout << (dfs(n) <= k ? "YES" : "NO") << endl;
    return 0;
}