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

//D=n^2-m^2 , 1 <= n,m <= Nを満たす組み合わせの数え上げ
int count(int d,int N){
    if(d < 0){
        d = -d;
    }
    int c = 0;
    for(int i=1;i*i<d;i++){
        if(d % i != 0) continue;
        if(i % 2 != (d/i) % 2) continue;
        if(2 <= (d/i) - d && (d/i) + d <= N){
            c++;
        }
    }
    return c;
}

int main(){
    int N,D;
    int c = 0;
    scanf("%d %d",&N,&D);
    for(int a=1;a<=N;a++){
        for(int b=1;b<=N;b++){
            c += count(D - a*a - b*b,N);
        }
    }
    printf("%d",c);
}