#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, n, a) for (int i = (int)(n); i >= (int)(a); i--)

void solve(){
    ll n,k; cin >> n >> k;
    ll p = n-k;
    ll answer = 0;
    ll d = (k == 0 ? 1 : k);
    while(p > 1 && d < sqrt(p)){
        if(p % d == 0){
            if(d <= k){
                answer++;
            } else{
                answer += 2;
            }
        }
        d++;
    }
    if(p == (ll)sqrt(p)*(ll)sqrt(p) && (ll)sqrt(p) >= k) answer++;
    if(k != 0) answer++;
    cout << answer;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    solve();

    return 0;
}