#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
const int inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;

ll ans = 0, N, K;

template <typename T>
vector<T> divisor(T n)
{
    vector<T> divisor;
    for (T i = 1; i * i <= n; i++)
    {
        if (n % i == 0)
        {
            divisor.push_back(i);
            if (i * i != n)
                divisor.push_back(n / i);
        }
    }
    sort(divisor.begin(), divisor.end());
    return divisor;
}

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

    auto d = divisor(K);

    for (int i = 0; i < d.size(); i++)
    {
        ll ac, bd;
        if (d[i] <= N)
            ac = max(d[i] - 1LL, 0LL);
        else if (2 * N <= d[i])
            ac = 0;
        else
            ac = 2 * N - (d[i] - 1LL);

        if (K / d[i] <= N)
            bd = max(K / d[i] - 1LL, 0LL);
        else if (2 * N <= K / d[i])
            bd = 0;
        else
            bd = 2 * N - (K / d[i] - 1LL);
        ans += ac * bd;
    }

    cout << ans << endl;
}