#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i,n,m) for(int i=(n);i<(m);i++)
#define REP(i,n) for(int i=0;i<(n);i++)
#define REPR(i,n) for(int i=(n);i>=0;i--)
#define all(vec) vec.begin(),vec.end()
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using P=pair<ll,ll>;
using PP=pair<ll,P>;
using vp=vector<P>;
using vpp=vector<PP>;
using vs=vector<string>;
#define fi first
#define se second
#define pb push_back
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(a>b){a=b;return true;}return false;}
template<typename A,typename B>istream&operator>>(istream&is,pair<A,B> &p){is>>p.fi>>p.se;return is;}
template<typename A,typename B>ostream&operator<<(ostream&os,const pair<A,B> &p){os<<"("<<p.fi<<","<<p.se<<")";return os;}
template<typename T>istream&operator>>(istream&is,vector<T> &t){REP(i,t.size())is>>t[i];return is;}
template<typename T>ostream&operator<<(ostream&os,const vector<T>&t){os<<"{";REP(i,t.size()){if(i)os<<",";os<<t[i];}cout<<"}";return os;}
const ll MOD=1000000007LL;
const int INF=1<<30;
const ll LINF=1LL<<60;
int lg2(int x){
    int res=0;
    while(x){
        x>>=1;
        res++;
    }
    return res;
}
bool inf(int n,int m){
    int b=0;
    int k=1;
    while(n){
        if(n%2==0){
            b+=k;
        }
        k*=2;
    }
    if(k-b<=m){
        return true;
    }
    return false;
}
int main(){
    int n,m;
    cin>>n>>m;
    if(!n){
        if(m){
            cout<<"INF"<<endl;
        }else{
            cout<<1<<endl;
        }
        return 0;
    }
    if(inf(n,m)){
        cout<<"INF"<<endl;
        return 0;
    }
    int l=lg2(n);
    int ans=0;
    FOR(i,n,1<<(l+2)){
        if((i&n)!=n){
            continue;
        }
        REP(j,m+1){
            if((i&(i+j))==n){
                ans++;
            }
        }
    }
    cout<<ans<<endl;
    return 0;
}