#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif

#define int long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = 1'000'000'007;
template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }

template<typename T>
vector<T> gen_v(size_t a) { return vector<T>(a); }
template<typename T, typename ...Ts>
auto gen_v(size_t a, Ts... ts) { return vector<decltype(gen_v<T>(ts...))>(a, gen_v<T>(ts...)); }
template<typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type
fill_v(T &t, const V &v) { t = v; }
template<typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type
fill_v(T &t, const V &v) { for (auto &e : t) fill_v(e, v); }

signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N, K; cin >> N >> K;
	if (N == 0 && K == 0)
		cout << 1 << endl;
	else {
		int e = ceil(log2(1e5)) + 1;

		int y = N;
		int p = 0;
		while (y) {
			p++;
			y /= 2;
		}
		y = N + (1LL << p);
		dump(y);

		int x = (1LL << p) - 1;
		dump(y, x);
		if (y - x <= K) {
			cout << "INF" << endl;
		}
		else {
			int MAX = 1LL << e;
			int ans = 0;
			rep(y, 0, MAX) {
				rep(x, y - K, y + 1) {
					if ((x & y) == N) {
						ans++;
					}
				}
			}
			cout << ans << endl;
		}

	}
	return 0;
}