#include<cstdio>
#include<algorithm>
using namespace std;

int ciur[1000001], put[1000001];


int main()
{
    FILE *in, *out;
    in=fopen("mins.in ", "r");
    out=fopen("mins.out", "w");
    long long i, j, c, d;
    fscanf(in, "%d%d", &c, &d);
    c--;
    d--;
    int lmax=min(c, d);
    long long rasp=c*d;
    for(i=2; i<=lmax; i++)
    {
        if(!ciur[i])
        {
            for(j=i; j<=lmax; j+=i)
            {
                ciur[j]++;
            }

            for(j=i*i; j<=lmax; j+=i*i)
                put[j]=1;
        }
    }
    for(i=2; i<=lmax; i++)
        if(!put[i])
            if(ciur[i]%2)
                rasp-=(long long)(c/i)*(d/i);
            else
                rasp+=(long long)(c/i)*(d/i);
    fprintf(out, "%lld", rasp);
}