/*
TASK: rtri
LANG: C++
*/
#include <iostream>
using namespace std;
long long fnk(int numP)
{
    if (numP == 1) return 0;
    if (numP == 2) return 3;
    int i, j, k;
    long long cnt = 0;
    for (i=0;i < numP;i++)
     for (j=i+1;j < numP;j++)
      if (i != j)
       for (k=j+1;k < numP;k++)
        if (k != i && k != j)
         if (3*min(i, min(j, k)) + 3 != i + j + k)
          cnt++;
    
    return cnt;
}

int main()
{
    int w, h, i, j;
    cin >> h >> w;
    //w = 1; h = 2;
        
    int numP = (w + 1) * (h + 1);
    long long cnt = fnk(numP);
    //cout << cnt << endl;
    
    //cnt -= (numP / 3)*(fnk(h) + fnk(w));
    //cnt -= (fnk(numP - 6));
    
    cout << cnt << endl;
    //system("pause");
    return 0;
}
