#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<ll,ll> pll;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll gcd(ll a,ll b){
  if(a<b)swap(a,b);
  if(a%b==0)return b;
  return gcd(b,a%b);
}
ll lcm(ll a,ll b){
  ll ret=a*b;
  ll u=gcd(a,b);
  return ret/u;
}
int main(){
  ll n,k;cin>>n>>k;
  ll u;
  if(n==0){
    if(k==0)cout<<1<<endl;
    else cout<<"INF"<<endl;
    return 0;
  }
  if(k==0){
    cout<<1<<endl;
    return 0;
  }
  for(int i=0;;i++){
    if(pow(2,i)>n){
      u=i;
      break;
    }
  }
  ll dp[20][k+1];
  for(int i=0;i<20;i++)fill(dp[i],dp[i]+k+1,0);
  dp[0][0]=1;
  if(n%2==0){
    dp[0][1]=2;
  }
  for(int i=0;i<19;i++){
    ll p=pow(2,i+1);
    ll y=n/p;
    for(int j=0;j<=k;j++){
      dp[i+1][j]+=dp[i][j];
      if(y%2==1)continue;
      if(j+p<=k){
        dp[i+1][j+p]+=dp[i][j];
      }
      if(p-j<=k&&p-j>=0){
        dp[i+1][p-j]+=dp[i][j];
      }
    }
  }
  ll ans=1;
  ll sum=0;
  for(int i=1;i<=k;i++){
    sum+=dp[19][i];
  }
  cout<<ans+sum/2<<endl;
  //for(int i=0;i<u;i++){
    //for(int j=0;j<=k;j++)cout<<dp[i][j]<<" ";
    //cout<<endl;
  //}
}