#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
typedef pair<int, int> pint;

vector<pll> enum_divisors(long long N) {
    vector<pll> res;
    for (long long i = 1; i * i <= N; ++i) {
        if (N % i == 0) {
            // 重複しないならば i の相方である N/i も push
            res.push_back({i, N / i});
        }
    }
    return res;
}

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

    ll N, K;
    cin >> N >> K;
    ll ans = 0, diff = 0;
    vector<pll> en = enum_divisors(K);
    rep(i, en.size()) {
        if (en[i].first > 2 * N || en[i].second > 2 * N)
            continue;
        else {
            ll tmp1, tmp2;
            if (en[i].first > N)
                tmp1 = 2 * N - en[i].first + 1;
            else {
                tmp1 = en[i].first - 1;
            }
            if (en[i].second > N)
                tmp2 = 2 * N - en[i].second + 1;
            else {
                tmp2 = en[i].second - 1;
            }
            ans += (tmp1 * tmp2);

            if (en[i].first == en[i].second)
                diff += (tmp1 * tmp2);
        }
    }

    ans *= 2;

    cout << ans - diff << endl;
}