#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    ll n,k;cin>>n>>k;

    if(n==0 and k==0){
        cout<<"INF"<<endl;
        return 0;
    }

    ll d=0;
    ll tmp=n;
    while(tmp){
        d++,tmp>>=1;
    }

    ll dif=n+(1ll<<d)-(1ll<<d)-1;
    if(dif<=k){
        cout<<"INF"<<endl;
        return 0;
    }

    ll ans=0;
    for(ll y=n;y<=50000000;y++){
        if((y&n)!=n) continue;
        for(ll x=max(0ll,y-k);x<=y;x++){
            if((x&y)==n){
                // cout<<bitset<20>(x)<<" "<<bitset<20>(y)<<endl;
                ans++;
            }
        }
    }
    cout<<ans<<endl;
    return 0;
}