#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 998244353;

int main(){
    int N, M, K;
    cin >> N >> M;
    K = min(N, M);
    vector<int> mu(K+1, 1);
    vector<bool> is(K+1, true);
    is[0] = false;
    is[1] = false;

    for (int n = 2; n <= K; n++){
        if (!is[n]) continue;
        for (int m = n; m <= K; m += n) mu[m] *= -1, is[m] = false;
        if ((ll)n*n > K) continue;
        for (int m = n*n; m <= K; m += n*n) mu[m] = 0;
    }

    ll ans = 0;
    for (int n = 1; n <= K; n++) ans += (ll)mu[n]*(N/n)*(M/n);
    cout << ans << endl;
}