#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <queue>
#include <stack>

using namespace std;

typedef long long int ll;
typedef pair<int, int> Pii;

const ll mod = 998244353;

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

  ll n, k;
  cin >> n >> k;

  ll ans = 0;
  ll x = n - k;
  for (ll i = 1; i * i <= x; i++) {
    if (x % i == 0) {
      if (i > k) ans++;
      if (x / i > k && i != x / i) ans++;
    }
  }

  cout << ans << endl;

  return 0;
}