#include #include using namespace std; using namespace atcoder; using ll = long long; using db = long double; using ch = char; using bl = bool; using st = string; using pll = pair; using psl = pair; using vst = vector; using vch = vector; using vvch = vector; using vbl = vector; using vvbl = vector; using vdb = vector; using vpll = vector; using vvpll = vector; using vpsl = vector; using vi = vector; using vvi = vector; using vvvi = vector; using vvvvi = vector; using vll = vector; using vvll = vector; using vvvll = vector; using vvvvll = vector; using vvvvvll = vector; #define all(A) A.begin(),A.end() #define rep(i, n) for (ll i = 0; i < (ll)(n); i++) #define rrep(i,a,b) for(ll i=(ll)(a);i<=(ll)(b);i++) #define drep(i,n) for(ll i=(ll)n-1; i>=0; i--) #define drrep(i,a,b) for(ll i=(ll)a; i>=(ll)b; i--) using mint = modint998244353; // using mint = modint1000000007; using vm = vector; using vvm = vector; using vvvm = vector; const ll mod = 998244353; const ll INF = 3e18; template inline bool chmin(T &a, T b) { if (a>b) { a=b; return true; } return false; } template inline bool chmax(T &a, T b) { if (a0) { if(n%2==1)res*=a; a*=a; n/=2; } return res; } ll Pow(ll a, ll n, ll p) { ll res=1; while(n>0) { a%=p; if(n%2==1)res*=a; a*=a; res%=p; n/=2; } return res; } void yn(bl ok) { cout << (ok?"Yes":"No") << endl; return; } ll N,K; int main() { cin>>N>>K; ll ans=0; for(ll i=1; i*i<=N-K; i++) { if((N-K)%i==0) { if(i>K)ans++; if(i*i!=(N-K)&&(N-K)/i>K)ans++; } } cout << ans << endl; return 0; }