#include <iostream>

using namespace std;

int gcd(int a, int b)
{
	return b == 0 ? a : gcd(b, a % b);
}

int main(void)
{
	int iCase = 0;
	int m, n;

	while(cin >> m >> n, m || n) {
		long long a = (m + 1) * (n + 1);
		long long c = a * (a - 1) * (a - 2) / 6;
		
		c -= a * m * (m - 1) / 6; // == (n+1) * C(m+1,3)
		c -= a * n * (n - 1) / 6; // == (m+1) * C(n+1,3)

		for(int i = 1; i <= m; i++) {
			for(int j = 1; j <= n; j++) {
				c -= 2 * (long long)(gcd(i, j) - 1) * (m - i + 1) * (n - j + 1);
			}
		}

		cout << "Case " << (++iCase) << ": " << c << endl;
	}

	return 0;
}