#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;

int consistency(int a, int b){
    if(a==0 && b>0) return 0;
    if(a==0 && b==0) return -1;
    if(a==1 && b==0) return 1;
    if(b==a) return -1;

    int n = abs(a-b);

    if(n<=b) return 0;

    int ct = 1;  //* considering n 
    if(b==0) ct++; //* considering 1 also for mod == 0

    for(int i=2; i*i<=n; i++){
        if(n%i != 0) continue;

        if(a%i == b) ct++;

        if(i != n/i){
            int d = n/i;

            if(a%d == b) ct++;
        }

    }

    return ct;

}















int practice(int a, int b){


    return 0;
}





void solve() {
    
    int a, b;
    cin>> a >> b;
    
    
    int ans = consistency(a, b);
    if(ans == -1) cout << "infinity" << endl;
    else cout << ans << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}