#include <bits/stdc++.h>
using namespace std;

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

    long long ans = 0;
    unordered_map<long long, long long> mp;
    unordered_set<long long> st;
    for(long long i = 1;i <= n;i++){
        for(long long j = 1;j <= n;j++){
            mp[i*i+j*j]++;
            //st.insert(i*i+j*j);
        }
    }


  	for(long long i = 1;i <= n;i++){
        for(long long j = 1;j <= n;j++){
            //if(st.find(i*i-j*j+d) != st.end()){
                ans += mp[i*i-j*j+d];
            //}
        }
    }

    cout << ans << endl;

    return 0;
}