#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;

int p[(int)8e+6 + 1];

int main() {
    int n, d;
    cin >> n >> d;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            p[i * i + j * j]++;
        }
    }

    ll r = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            int t = i * i - j * j + d;
            if (t <= 0 || t > (int)8e+6) continue;
            r += p[t];
        }
    }

    cout << r << endl;

    return 0;
}