#include <bits/stdc++.h>
#include <atcoder/all>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace atcoder;
using namespace __gnu_pbds;
using ll=long long;
using ld=long double;
using vll=vector<ll>;
using vvll=vector<vll>;
using pll=pair<ll,ll>;

// using mint=modint;

// template<class K,class V>
// using ordered_map=tree<K,V,less<K>,rb_tree_tag,tree_order_statistics_node_update>;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

    ll N,K;
    cin>>N>>K;

    //2倍の操作回数をd回として（ここは全探索）
    for(ll d=0;;d++){
        ll p=1LL<<d;
        if(p>N)break;
        if((N-p)%3!=0)continue;
        ll T=(N-p)/3;
        ll q=T/p,r=T%p;
        if(d+q+__builtin_popcountll(r)<=K){
            cout<<"YES"<<endl;
            return 0;
        }
    }
    cout<<"NO"<<endl;

}