import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }

// floor(a / b)
Int divFloor(Int)(Int a, Int b) {
  return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);
}

// ceil(a / b)
Int divCeil(Int)(Int a, Int b) {
  return a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0);
}


void main() {
  try {
    for (; ; ) {
      long[2] T, A, B;
      foreach (i; 0 .. 2) T[i] = readLong();
      foreach (i; 0 .. 2) A[i] = readLong();
      foreach (i; 0 .. 2) B[i] = readLong();
      
      long[2] d;
      foreach (i; 0 .. 2) d[i] = T[i] * (A[i] - B[i]);
      if (d[0] + d[1] < 0) {
        swap(A, B);
        d[] *= -1;
      }
      if (d[0] + d[1] == 0) {
        writeln("infinity");
      } else {
        long ans;
        // (d[0] + d[1]) k + d[0] < 0
        ans += 2 * divCeil(-d[0], d[0] + d[1]) - 1;
        // (d[0] + d[1]) k + d[0] == 0
        if ((-d[0]) % (d[0] + d[1]) == 0) {
          const k = (-d[0]) / (d[0] + d[1]);
          if (k >= 0) {
            ++ans;
          }
        }
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}
