#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T gcd(T a, T b) {
  return (b) == 0 ? (a) : gcd((b), ((a) % (b)));
}
template <class T>
inline T lcm(T a, T b) {
  return ((a) / gcd((a), (b)) * (b));
}
template <class T>
inline T BigMod(T Base, T power, T M = 1000000007) {
  if (power == 0) return 1;
  if (power & 1)
    return ((Base % M) * (BigMod(Base, power - 1, M) % M)) % M;
  else {
    T y = BigMod(Base, power / 2, M) % M;
    return (y * y) % M;
  }
}
template <class T>
inline T ModInv(T A, T M = 1000000007) {
  return BigMod(A, M - 2, M);
}
int fx[] = {-1, +0, +1, +0, +1, +1, -1, -1, +0};
int fy[] = {+0, -1, +0, +1, +1, -1, +1, -1, +0};
int day[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int a, b;
  cin >> a >> b;
  a -= b;
  if (a == 0) {
    cout << "infinity";
    return 0;
  }
  double z = sqrt(a);
  vector<int> v;
  for (int i = 1; i <= z; i++) {
    if (a % i == 0) {
      int x = a / i;
      v.push_back(x);
      if (x != i) v.push_back(i);
    }
  }
  sort(v.begin(), v.end());
  int y = upper_bound(v.begin(), v.end(), b) - v.begin();
  int len = v.size();
  cout << len - y;
  return 0;
}
