#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <queue>
#include <stack>
#include <math.h>
#include <set>
#define ALL(obj) (obj).begin(),(obj).end()
#define RALL(obj) (obj).rbegin(),(obj).rend()
#define P pair<int,int>

#define MOD 1000000007
#define INF 2147483647
#define NINF (-2147483647-1)
#define LLINF 9223372036854775807
using ll = long long;
using namespace std;

int main() {
    int N, D;
    cin >> N >> D;
    vector<int> XY(2 * N * N + 1, 0), ZW(2 * N * N + 1, 0);
    for (int x = 1; x <= N; x++)
    {
        for (int y = 1; y <= N; y++)
        {
            XY[x*x + y*y]++;
        }
    }
    for (int w = 1; w <= N; w++)
    {
        for (int z = 1; z <= N; z++)
        {
            int k = w * w - z * z + D;
            if (k >= 2 && k <= 2 * N * N) {
                ZW[k]++;
            }
            else if (k <= 1) {
                break;
            }
        }
    }
    ll cnt = 0;
    for (int i = 0; i <= 2 * N * N; i++)
    {
        cnt += XY[i] * ZW[i];
    }
    cout << cnt << endl;
    getchar(); getchar();
    return 0;
}