Problem:
Score: 600 points

Problem Statement

Takahashi and Aoki are training for long-distance races in an infinitely long straight course running from west to east.

They start simultaneously at the same point and moves as follows towards the east:

Takahashi runs A_1 meters per minute for the first T_1 minutes, then runs at A_2 meters per minute for the subsequent T_2 minutes, and alternates between these two modes forever.

Aoki runs B_1 meters per minute for the first T_1 minutes, then runs at B_2 meters per minute for the subsequent T_2 minutes, and alternates between these two modes forever.

How many times will Takahashi and Aoki meet each other, that is, come to the same point? We do not count the start of the run. If they meet infinitely many times, report that fact.

Constraints

1 \leq T_i \leq 100000

1 \leq A_i \leq 10^{10}

1 \leq B_i \leq 10^{10}

A_1 \neq B_1

A_2 \neq B_2

All values in input are integers.

Input

Input is given from Standard Input in the following format:

T_1 T_2
A_1 A_2
B_1 B_2

Output

Print the number of times Takahashi and Aoki will meet each other.

If they meet infinitely many times, print infinity instead.

Sample Input 1

1 2
10 10
12 4

Sample Output 1

1

They will meet just once, \frac{4}{3} minutes after they start, at \frac{40}{3} meters from where they start.

Sample Input 2

100 1
101 101
102 1

Sample Output 2

infinity

They will meet 101, 202, 303, 404, 505, 606, ... minutes after they start, that is, they will meet infinitely many times.

Sample Input 3

12000 15700
3390000000 3810000000
5550000000 2130000000

Sample Output 3

113

The values in input may not fit into a 32-bit integer type.

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.*;
import java.io.*;

class Main {
	public static void main(String[] args) {
		new Main().run();
	}

	final long MOD = (long) (1e9 + 7);
	int NMAX = 100000;
	long[] fac = new long[NMAX];
	long[] ifac = new long[NMAX];
	long[] inv = new long[NMAX];
	{
		fac[0] = fac[1] = ifac[0] = ifac[1] = inv[0] = inv[1] = 1;
		for (int i = 2; i < NMAX; ++i) {
			fac[i] = fac[i - 1] * i % MOD;
			inv[i] = MOD - inv[(int) (MOD % i)] * (MOD / i) % MOD;
			ifac[i] = ifac[i - 1] * inv[i] % MOD;
		}
	}

	long comb(int n, int k) {
		if (n >= k) {
			return fac[n] * ifac[k] % MOD * ifac[n - k] % MOD;
		} else {
			return 0;
		}
	}

	void run() {
		Scanner sc = new Scanner(System.in);
		long T1 = sc.nextLong();
		long T2 = sc.nextLong();
		long A1 = sc.nextLong();
		long A2 = sc.nextLong();
		long B1 = sc.nextLong();
		long B2 = sc.nextLong();
		A1 -= B1;
		A2 -= B2;
		B1 = 0;
		B2 = 0;
		// 何回原点に戻ってくるか？

		if (A1 < 0) {
			A1 *= -1;
			A2 *= -1;
		}
		if (A1 * T1 + A2 * T2 == 0) {
			System.out.println("infinity");
			return;
		}
		long d = A1 * T1 + A2 * T2;
		if (d > 0) {
			System.out.println(0);
			return;
		}
		d = Math.abs(d);
		A2 = Math.abs(A2);
		// A1*T1 > m*dなるdについて2d-1が答え。
		long ans = A2 * T2 / d;
		if (A2 * T2 > (ans + 1) * d)
			++ans;
		int bonus = 0;
		if (A2 * T2 == (ans + 1) * d)
			++bonus;
		System.out.println(2 * ans - 1 + bonus);
	}

	void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}

}