#include <iostream>
using namespace std;
using ll = long long;
int main() {
  ll N, K; cin >> N >> K;
  ll ans = 0;
  for (ll i = 1; i * i <= K; ++i)
    if (K % i == 0) {
      ll ac = K / i, bd = i;
      ans += max(0LL, (min(N, ac-1) - max(ac-N, 1LL) + 1) * (min(N, bd-1) - max(bd-N, 1LL) + 1));
      if (i * i != K)
        ans += max(0LL, (min(N, ac-1) - max(ac-N, 1LL) + 1) * (min(N, bd-1) - max(bd-N, 1LL) + 1));
    }
  cout << ans << endl;
  return 0;
}