import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
bool minimize(T)(ref T x, T y) { if (x > y) { x = y; return true; } else { return false; } }
bool maximize(T)(ref T x, T y) { if (x < y) { x = y; return true; } else { return false; } }

long mod = 10^^9 + 7;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{	
	auto N = RD;
	auto K = RD;

	if (N < K)
	{
		writeln("INF");
	}
	else
	{
		auto bits = N ^ ((2^^20)-1);
		long[] a = [0];
		foreach (i; 0..20)
		{
			auto bit = 1LU << i;
			if (bit & bits)
			{
				a ~= bit;
			}
		}

		debug writeln(a);

		bool[long] cnt;
		foreach (pos; 0..a.length)
		{
			foreach_reverse (i; 0..2^^pos)
			{
				long x;
				foreach (j; 0..pos)
				{
					auto bit = 1LU << j;
					if ((bit & i) == 0) continue;
				
					x += a[j];
				}
				if (x < a[pos] - K) break;

				foreach (j; 2^^pos..2^^a.length)
				{
					long y;
					foreach (k; pos..a.length)
					{
						auto bit = 1LU << k;
						if ((bit & j) == 0) continue;

						y += a[k];
					}
					if (y - x > K) break;
					cnt[(y<<32)+x] = true;
				}
			}
		}

		writeln(cnt.keys.length);
	}
	
	stdout.flush();
	debug readln();
}