#include <iostream>
#include <cassert>
#include <set>
using namespace std;
using ll = long long;

int div_count(ll n) {
    set<ll> cnt;
    for (ll i = 1; i * i <= n; ++i) {
        if (n % i == 0) {
            cnt.insert(i);
            cnt.insert(n / i);
        }
    }
    return cnt.size();
}

int main() {
    ll n, k;
    cin >> n >> k;
    assert(1 <= n && n <= 1000000000000);
    assert(0 <= k && k < n);
    n -= k;
    int ans = div_count(n);
    if (k == 0) {
        cout << ans << endl;
    } else {
        cout << ans - 1 << endl;
    }
    return 0;
}