#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}else{return false;}}
template<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}else{return false;}}
/* ASCII
[0:48],[1:49],[2:50],[3:51],[4:52],[5:53],[6:54],[7:55],[8:56],[9:57],
[A:65],[B:66],[C:67],[D:68],[E:69],[F:70],[G:71],[H:72],[I:73],[J:74],[K:75],[L:76],[M:77],
[N:78],[O:79],[P:80],[Q:81],[R:82],[S:83],[T:84],[U:85],[V:86],[W:87],[X:88],[Y:89],[Z:90],
[a:97],[b:98],[c:99],[d:100],[e:101],[f:102],[g:103],[h:104],[i:105],[j:106],[k:107],[l:108],[m:109],
[n:110],[o:111],[p:112],[q:113],[r:114],[s:115],[t:116],[u:117],[v:118],[w:119],[x:120],[y:121],[z:122]
*/


// 素因数分解
template <typename T>
map<T, T> prime_factor(T n) {
    map<T, T> ret;
    for (T i = 2; i * i <= n; i++) {
        T tmp = 0;
        while (n % i == 0) {
            tmp++;
            n /= i;
        }
        ret[i] = tmp;
    }
    if (n != 1) ret[n] = 1;
    return ret;
}
/*  divisor_num(n)
    入力：整数 n
    出力：nの約数の個数
    計算量：O(√n)
*/
template <typename T>
T divisor_num(T N) {
    map<T, T> pf = prime_factor(N);
    T ret = 1;
    for (auto p : pf) {
        ret *= (p.second + 1);
    }
    return ret;
}


int main(void){
    long long N, K; cin >> N >> K;
    long long X = N - K;
    cout << divisor_num(X) - 1 + (K == 0 ? 1 : 0)<< endl;
}