#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for (int i=(int)(b); i<(int)(e); i++)
#define ALL(x) (x).begin(), (x).end()

const double PI = acos(-1);

int solve(int n, int k) {
  if (n == 0) 
    return k ? -1 : 1;

  int b = 1;
  while (n >= b) {
    b <<= 1;
  }

  int c = (b-1) & ~n;
  if (k >= b-c)
    return -1;

  int ret = 0;
  for (int x = n; x < b; x++) {
    if ((x & n) != n) continue;
    for (int y = x; y <= x + k; y++) {
      if ((x & y) == n)
        ++ret;
    }
  }
  return ret;
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n, k;
  cin >> n >> k;
  int ret =  solve(n, k);

  if (ret == -1)
    cout << "INF" << endl;
  else
    cout << ret << endl;
  
  return 0;
}