#include<iostream>
#include<fstream>
#define M 1000005
using namespace std;
long long i,c,d,nr_p, cnt[M],ma;
/*void ciur(int ma)
{
    for(int i=2;i<=ma;i++)
        {
            if(fr[i]==0)
            for(int j=i;j<=ma;j+=i)
            {
                fr[j]=1;
            }

        }
}*/
int cmmdc(int x,int y) {
	if(!y) return x;
	return cmmdc(y,x%y);
}
int main()
{
    freopen("mins.in","r",stdin);
    freopen("mins.out","w",stdout);
    cin>>c>>d;
    c--;
    d--;
    int mi=min(c, d);
    int ma=max(c, d);
    for(int x=2;x<=mi;x++)
    {
        for(int y=1;y<x;y++)
            if(cmmdc(x, y)==1)
            nr_p++;
    }
    nr_p=nr_p*2;
    for(int x=mi+1;x<=ma;x++)
    {
        for(int y=1;y<=mi;y++)
            nr_p++;
    }
    cout<<nr_p+1;
    /*
    cin>>c>>d;
    c=c-1;
    d=d-1;
    for(int k=2;k<=M;k++)
    {
        nr_p -= (cnt[k]-1)*c/k*d/k;
        for(int j=2*k; j<=M; j+=k)
        {
            cnt[j]-=(cnt[k]-1);
        }
    }

    cout<<c*d-nr_p;*/
}