// includes {{{
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<random>
#include<cassert>
#include<bitset>
#include<cstdlib>
// #include<deque>
// #include<multiset>
// #include<cstring>
// #include<bits/stdc++.h>
// }}}
using namespace std;
using ll = long long;

void INF() {
  cout << "INF" << endl;
  exit(0);
}

ll n, k;

ll dfs(int i, int a, int b, int d) {
  ll minD = d - ((1 << (i + 1)) - 1);
  ll maxD = d + ((1 << (i + 1)) - 1);
  if(minD > k) return 0;
  if(maxD < 0) return 0;
  if(i == -1) return 1;
  ll res = 0;
  if(n & (1 << i)) {
    res += dfs(i - 1, 1, 1, d);
  } else {
    res += dfs(i - 1, 0, 0, d);
    res += dfs(i - 1, 0, 1, d - (1 << i));
    res += dfs(i - 1, 1, 0, d + (1 << i));
  }
  return res;
}

int main() {
  std::ios::sync_with_stdio(false), std::cin.tie(0);
  cin >> n >> k;
  if(dfs(17, 1, 0, 1 << 18)) INF();
  cout << dfs(17, 0, 0, 0) << endl;
  return 0;
}