#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repn(i,end) for(long long i = 0; i <= (long long)(end); i++)
#define reps(i,start,end) for(long long i = start; i < (long long)(end); i++)
#define repsn(i,start,end) for(long long i = start; i <= (long long)(end); i++)
#define ll long long
#define ld long double
#define print(t) cout << t << endl 
#define all(a)  (a).begin(),(a).end()
// << std::fixed << std::setprecision(0)
const ll INF = 1LL << 60;
 
template<class T> bool chmin(T& a, T b){
 if(a > b){
  a = b;
  return true;
 }
  return false;
}
 
template<class T> bool chmax(T& a, T b){
 if(a < b){
  a = b;
  return true;
 }
  return false;
}
  
ll lpow(ll x,ll n){
  ll ans = 1;
  while(n >0){
    if(n & 1)ans *= x;
    x *= x;
    n >>= 1;
  }
  return ans;
}

vector<ll> divisor(ll n){
  vector<ll> ret;
  for(ll i = 1;i * i <= n;i++){
    if(n % i == 0){
      ret.push_back(i);
      if(i * i != n)ret.push_back(n/i);
    }
  }
  //昇順
  sort(all(ret));
  return ret;
}
 
int main(){
  ll n,k;cin >> n >> k;
  ll nd = n-k;
  vector<ll> div = divisor(nd);
  ll ans = 0;
  for(auto &p :div){
    if(p >k){
      ans++;
    }
  }
  cout << ans << endl;
}