#include <cmath>
#include <vector>
#include <iostream>
using namespace std;
int main() {
    int n, D; cin >> n >> D;
    constexpr int N = 9'000'001;
    vector<int> div(N, 0);
    for (int d = 1; d <= n; d++)
        for (int m = d+2; m <= 2*n - d && m * d < N; m += 2)
            div[m*d]++;

    long long ans = 0;
    for (int x = 1; x <= n; x++)
        for (int y = 1; y <= n; y++) {
            int v = abs(x*x + y*y - D);
            if (v == 0) ans += n;
            else ans += div[v];
        }
    cout << ans << endl;
}