#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

int main() {
  int N, K;
  cin >> N >> K;

  if (N < K) {
    cout << "INF" << endl;
  } else {
    ll ans = 0;

    for (int y = N; y <= 2 * N; ++y) {
      for (int i = 0; i <= K; ++i) {
        int x = y + i;
        if ((y & x)  == N) ++ans;
      }
    }

    cout << ans << endl;
  }

  return 0;
}