#include <iostream>
#include<fstream>
using namespace std;
char nrdiv[1000005];
int t,n,m,sgn;
long long pairs,sum;
int main()
{
    ifstream f("mins.in");
    ofstream g("mins.out");
    f>>n>>m;n--;m--;
    for(int i=2;i<=n;i++)
    {
      if(nrdiv[i]!=-1)
        for(int j=i;j<=n;j+=i)
        {
            if((j/i)%i==0) nrdiv[j]=-1;
            if(nrdiv[i]<=1&&nrdiv[j]!=-1) nrdiv[j]++;
        }
        if(nrdiv[i]!=-1)
        {
            if(nrdiv[i]%2==0) sgn=-1;
            else sgn=1;
            sum+=(1LL)*(n/i)*(m/i)*sgn;
        }
    }
    pairs=(1LL)*m*n-sum;
    g<<pairs;
    return 0;
}