#include <iostream>
#include <math.h>
using namespace std;

typedef long long LL;

inline LL count(LL sum, LL N) 
{
    LL ret = 0;
    if (1 < sum && sum <= N * 2) {
        ret = min(sum - 1, N) - max(1LL, sum - N) + 1;
    }
    // cout << "sum = " << sum << ", N = " << N << ", ret = " << ret << endl;
    return ret;
}

int main()
{
    LL N, K;
    cin >> N >> K;

    LL ans = 0;

    //! ab+bc+cd+da = (a+c)(b+d)
    //! Suppose (a+c) <= (b+d)

    for (LL ac = 1; ac * ac <= K; ++ac) {
        if (K % ac == 0) {
            LL bd = K / ac;
            ans += count(ac, N) * count(bd, N) * (ac == bd ? 1 : 2);
        }
    }

    cout << ans << endl;

    return 0;
}