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

int n, m;
int sum1[160006], sum2[160006];

int main()
{
    freopen("dreptunghiuri.in", "r", stdin);
    freopen("dreptunghiuri.out", "w", stdout);

    scanf("%d%d", &n, &m);

    long long ans = 1LL * n * m * (n - 1) * (m - 1) / 4;

    for (int X = 1; X < n ; ++X)
        for (int dx = 1; dx < n && n - dx >= X; ++dx)
            sum1[X * dx] += (n - dx - X);

    for (int Y = 1; Y < m ; ++Y)
        for (int dy = 1; dy < m && m - dy >= Y ; ++dy)
            sum2[Y * dy] += (m - dy - Y);

    for (int i = 1; i <= min(m * m, n * n) ; ++i)
        ans = ans + 1LL * sum1[i] * sum2[i];

    printf("%lld", ans);

    return 0;
}