#include<bits/stdc++.h>
#define maxN 405
using namespace std;
int n,m,a,b,c,delta;
int dp[maxN][maxN];
long long sol;
int main()
{
    freopen("dreptunghiuri.in","r",stdin);
    freopen("dreptunghiuri.out","w",stdout);

    scanf("%d%d",&n,&m);
    for(int L=1;L<n;L++)
        for(int l=1;l<m;l++)
    {
        for(int k=0;k<L;k++)
        {
            a=2;
            b=-2*l;
            c=-2*k*k+2*L*k;
            delta=b*b-4*a*c;
            if(delta<0) continue;

            if(delta==0)
            {
                double x=-b/(2.0*a);
                if(x==(int)x && x<l) dp[L][l]++;
            }
                else
            if(delta>0)
            {
                double rp=sqrt((double) delta);
                if(rp!=(int)rp) continue;
                double x1=(-b-rp)/(2.0*a);
                double x2=(-b+rp)/(2.0*a);
                if(x1==(int)x1 && x1<l) dp[L][l]++;
                if(x2==(int)x2 && x2<l) dp[L][l]++;
            }
        }
        sol=sol+1LL*(n-L)*(m-l)*dp[L][l];
    }
    printf("%lld\n",sol);
    return 0;
}