#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP(i,n,0)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 100000000

typedef long long ll;

int main() {
    int i;
    int a[3];
    rep (i,3) cin >> a[i];
    if (a[0] == a[2])
        cout << 0 << endl;
    else if (a[1] < min(a[0],a[2]) || a[1] > max(a[0],a[2]))
        cout << "INF" << endl;
    else {
        int cnt = 0;
        REP (i,2,*max_element(a,a+3)+1) {
            if (a[0]%i != a[2]%i && (a[1]%i < min(a[0]%i,a[2]%i) || a[1]%i > max(a[0]%i,a[2]%i))) {
                cnt++;
            }
        }
        cout << cnt << endl;
    }
    return 0;
}