/*
TASK:rtri
LANG:C++
*/
#include<stdio.h>
int main ()
{int s=0,i,j,m,n,p,q,a1,a2,l,g,o=0,d=0,br=0;
 char mas[31][31]={0};
scanf("%d%d",&m,&n);
for(i=0;i<m+1;i++)
 for(j=0;j<n+1;j++)
  {
  for(p=0;p<m+1;p++)
   for(q=0;q<n+1;q++)
    if(!(mas[p][q]))
     {
     a1=i;
     a2=j;
     a1-=p;
     a2-=q;
     while(a1>=0&&a2>=0)
     {if(p<=0&&q<=0)break;
      a1-=p;
      a2-=q;
      d++;
      mas[a1][a2]='1';
     }
     a1=i+p;
     a2=j+q;
     while(a1<=m+1&&a2<=n+1)
      {
      if(p<=0&&q<=0)break;
      a1+=p;
      a2+=q;
      d++;
      mas[a1][a2]='1';
      }
     g=q;
     l=-1*p;
     a1=i-g;
     a2=j-l;
     while(a1>=0&&a2>=0)
     {
     if(g<=0&&l<=0)break;
      a1-=g;
      a2-=l;
      o++;
      if(mas[a1][a2]!='0')break;
      mas[a1][a2]='1';
     }
     a1=i+g;
     a2=j+l;

     while(a1<=m+1&&a2<=n+1)
     {
     if(g<=0&&l<=0)break;
      a1+=g;
      a2+=l;
      o++;
      mas[a1][a2]='1';
     }
     if(o>0&&d>0)
      br+=(o-1)*(d-1);
    o=d=0;
    }
   for(a1=0;a1<m+1;a1++)
   for(a2=0;a2<n+1;a2++)
   mas[a1][a2]='0';
   }
   printf("%d",br);
   return 0;
     }



