#include <fstream>
using namespace std;

ifstream fin ("mins.in");
ofstream fout ("mins.out");

const int N = 1e6 + 5;

int n, m, M, div[N];
long long sol;
bool nok[N];

int main() {
    fin >> m >> n;
    m--, n--;
    sol = 1LL * m * n;
    M = max(m, n);
    for (int i = 2; i <= M; ++i) {
        if (div[i])
            continue;
        div[i] = 1;
        for (int j = i * 2; j <= M; j += i)
            div[j]++;
        for (int j = i * i; j <= M; j += i * i)
            nok[j] = 1;
    }
    for (int i = 2; i <= M; ++i)
        if (!nok[i])
            sol -= 1LL * (div[i] % 2 ? 1 : -1) * (m / i) * (n / i);
    fout << sol;
}