#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool can[300000];
ll n,k;
void dfs(ll now,ll ka){
    if(now > n)return;
    if(ka > k)return;
    if(can[now])return;
    //cout << now << " " << ka << endl;
    can[now] = true;
    if(ka >= k)return;
    dfs(2*now,ka+1);
    dfs(now+3,ka+1);
}
int main(){
    cin >> n >> k;
    dfs(7,2);
    dfs(5,2);
    dfs(4,1);
    dfs(2,1);
    dfs(1,0);
    if(can[n])cout << "YES" << endl;
    else cout << "NO" << endl;
}