#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;

int main(){
    int n,k;
    cin>>n>>k;
    int a=1;
    while(a<=n)a*=2;
    ll mi = a-1;
    ll ma = a + n;
    if(ma-mi<=k){
        cout<<"INF"<<endl;
        return 0;
    }
    ll ans=0;
    rep(i,10*(n+1))rep(j,k+1){
        ll x=i,y=i+j;
        if((x&y)==n)++ans;
    }
    cout<<ans<<endl;
    return 0;
}