#include<stdio.h>
#define N 1000100
long long n,m,i,j,p[N],pp[N],s[N],sol;
void read(),solve();
int main()
{
	read();
	solve();
	return 0;
}
void read()
{
	freopen("mins.in","r",stdin);
	freopen("mins.out","w",stdout);
	scanf("%lld%lld",&n,&m);
	if(n<m)n^=m^=n^=m;
}
void solve()
{
	p[1]=1;s[1]=1;
	for(i=2;i<m;i++)
	{
		if(p[i])continue;
		for(j=i;j<m;j+=i)p[j]=i;
		for(j=i*i;j<m;j+=i*i)pp[j]=i;
	}
	m--;n--;sol+=m*n;
	for(i=2;i<=m;i++)
	{
		if(pp[i])continue;
		s[i]=-s[i/p[i]];
		sol+=s[i]*(m/i)*(n/i);
	}
	printf("%lld\n",sol);
}