#include <iostream>
#include <string.h>
#include <random>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <iomanip>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <complex>
#include <valarray>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
typedef pair<int, int> pii;
typedef pair<int, string> pis;
typedef pair<string, string> pss;
typedef pair<int, char> pic;
typedef pair<pii, int> piii;
typedef pair<double, double> pdd;
typedef pair<float, float> pff;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ull, ull> pull;
typedef complex<double> cd;
//#define max(n, m) ((n>m)?n:m)
//#define min(n, m) ((n<m)?n:m)
#define f first
#define s second
#define input() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
 
ifstream fin("mins.in");
ofstream fout("mins.out");

int c, d, n, num, tmp, idx, l;
bitset<1000010> composite;
vector<int> fac[1000010];
int cnt[1000010];
void findPrimes()
{
    for(int i = 2; i <= n; i ++)
    {
        if(composite[i]) continue;
        fac[i].push_back(i);
        for(int j = 2; i*j <= n; j ++)
        {
            composite[i*j] = 1;
            fac[i*j].push_back(i);
        }
    }
}
int main()
{
    fin >> c >> d; n = max(c, d)-1;
    ll ans;
    for(int i = 0; i <= n; i ++)
        fac[i].reserve(8);
    findPrimes();
    for(int i = 2; i <= n; i ++)
    {
        num = 1;
        for(int j = 0; j < (1<<fac[i].size()); j ++)
        {
            if(num != 1) cnt[num]++;
            tmp = j; idx = 0;
            while(tmp%2)
                num/=fac[i][idx++], tmp/=2;
            num*=fac[i][idx];
        }
    }
    ans = (ll)(c-1)*(ll)(d-1);
    for(int i = 2; i < min(c, d); i ++)
    {
        num = 1; l = 0;
        for(int j = 0; j < (1<<fac[i].size()); j ++)
        {
            if(l%2) ans -= cnt[num];
            else ans += cnt[num];
            tmp = j; idx = 0;
            while(tmp%2)
                num/=fac[i][idx++],l--,tmp/=2;
            num*=fac[i][idx]; l++;
        }
    }
    fout << ans << '\n';
}