#include<stdio.h>
#include<math.h>
int N,num,put[]={0,1,3,7,15,31,63,127,255,511,1023},dns[]={1,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,
251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,
503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,
751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997,1};

long c,d,prod,lim,p[100];
long long s;

int main()
{
long aux,q,i,j,cc;
freopen("mins.in","r",stdin);
freopen("mins.out","w",stdout);
scanf("%ld%ld",&c,&d);
if (c>d)
{
aux=c;
c=d;
d=aux;
}
--c;
--d;
s=d;
for (i=2;i<=c;++i)
{
	cc=i;
	j=0;
	p[0]=0;
	s+=d;
	lim=sqrt(c);
	while(cc>1 && j<=167 && dns[j]<=lim)
		{
			if (cc%dns[++j]==0)
			{
				p[++p[0]]=dns[j];
				while(cc%dns[j]==0)
					cc/=dns[j];
			}
		}
	if (cc>1)
		p[++p[0]]=cc;
	N=put[p[0]];
	for (j=1;j<=N;++j)
		{
			prod=1;
			num=0;
			for (q=0;q<p[0];++q)
				if (j&(1<<q))
					{
						++num;
						prod*=p[q+1];
					}
			if (num%2==1)
				s-=d/prod;
			else
				s+=d/prod;
			
		}
}
printf("%lld",s);
return 0;
}