#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <cassert>
using namespace std;
using ll = long long;

int main() {
	int n, k; cin >> n >> k;
	if (n == 0) {
		if (k == 0) cout << 1 << endl;
		else cout << "INF" << endl;
		return 0;
	}
	ll ans = 0;
	for (int x = 0; x < 3000000; x++) {
		for (int y = max(0, x - k); y <= x; y++) {
			if ((x&y) == n) ans++;
		}
	}
	cout << ans << endl;
	return 0;
}