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

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
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; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

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; }
long lcm(long x, long y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998244353;
//long mod = 1_000_003;
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 T1 = RD;
	auto T2 = RD;
	auto A1 = RD;
	auto A2 = RD;
	auto B1 = RD;
	auto B2 = RD;
	A1 *= T1;
	A2 *= T2;
	B1 *= T1;
	B2 *= T2;

	if ((A1 > B1 && A1+A2 > B1+B2) || (A1 < B1 && A1+A2 < B1+B2))
	{
		writeln(0);
	}
	else if (A1+A2 == B1+B2)
	{
		writeln("infinity");
	}
	else if (A1*2+A2 == B1*2+B2)
	{
		writeln(2);
	}
	else if ((A1 < B1 && A1+A2 > B1+B2 && A1*2+A2 > B1*2+B2) || (A1 > B1 && A1+A2 < B1+B2 && A1*2+A2 < B1*2+B2))
	{
		writeln(1);
	}
	else
	{
		auto a = new long[](5);
		auto b = new long[](5);
		auto c = new long[](5);
		foreach (i; 0..2)
		{
			auto j = i * 2;
			a[j+1] = a[j] + A1;
			b[j+1] = b[j] + B1;
			c[j+1] = abs(a[j+1] - b[j+1]);
			a[j+2] = a[j+1] + A2;
			b[j+2] = b[j+1] + B2;
			c[j+2] = abs(a[j+2] - b[j+2]);
		}

		
		auto x1 = max(c[1], c[2]);
		auto y1 = min(c[1], c[2]);
		auto tmp1 = x1/ y1;
		auto x2 = max(c[2], c[3]);
		auto y2 = min(c[2], c[3]);
		auto tmp2 = x2/ y2;

		auto d1 = max(c[1], c[3]) - min(c[3], c[1]);
		auto d2 = max(c[2], c[4]) - min(c[4], c[2]);
		double ans = 0.0;
		ans += cast(double)max(c[1], c[3]) / d1;
		ans += cast(double)max(c[2], c[4]) / d2;
		writeln(cast(long)ans + 1);
		//auto ans = cast(double)x1/y1 + cast(double)x2/y2;
		//writeln(cast(long)ans + 1);
	}
	
	stdout.flush;
	debug readln;
}