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

const int N_MAX = 20005;
const char FIN[] = "mins.in";
const char FOU[] = "mins.out";

int sol[N_MAX][15], AUX[N_MAX], V[N_MAX];
int x2, y2, ct;

#define ll long long
#define MAX_P 1000000

ll M, A, B, fact[30];
int fprim[80000];
bool prim[MAX_P];

void prec() {
    //precalculez numerele prime mai mici ca sqrt(B)

	fill(prim + 2, prim + MAX_P, 1);

	for (int i = 2; i < MAX_P; i++)
		if (prim[i]) {
			for (int j = 2 * i; j < MAX_P; j += i)
				prim[j] = false;
			fprim[++fprim[0]] = i;
		}
}

int euler(ll A, ll B) {
    ll t = 0, d = 0;
    while (B > 1) {
		d++;
        if (B % fprim[d] == 0) {
            fact[++t] = fprim[d];
            while (B % fprim[d] == 0)
                B /= fprim[d];
        }

        if (fprim[d] > sqrt(B) && B > 1) {
            fact[++t] = B;
            B = 1;
        }
    }

    ll sol = A;
    for (int i = 1; i < (1 << t); i++) {
        ll nr = 0, prod = 1;
        for (int j = 0; j < t; j++)
            if ((1 << j) & i) {
                prod = 1LL * prod * fact[j + 1];
                nr++;
            }

        if (nr % 2) nr = -1;
        else nr = 1;

        sol = sol + 1LL * nr * A / prod;
    }

    return sol;
}

int ggt1( int n1, int n2 )
{
    for (int j = 1; j <= AUX[n2]; ++j)
       if ( n1 % sol[n2][j] == 0 ) return 2;
    return 1;
}

int main()
{
    freopen(FIN , "r" , stdin);
    freopen(FOU , "w" , stdout);

    prec();

    scanf("%d %d", &x2, &y2);

    int dx = x2 - 1;
    int dy = y2 - 1;
    int mini, maxi;

    if ( dx < dy ) mini = dx, maxi = dy;
    else mini = dy, maxi = dx;

    for (int i = 2; i <= mini; ++i)
        ct += euler(i , maxi);

    ct <<= 1, ct += maxi, ct -= mini;

    //for (int i = mini + 1; i <= maxi; ++i)
      //for (int j = 2; j <= mini; ++j)
         //if ( ggt1(i, j) == 1 ) ct++;

    printf("%d", ct);

    return 0;
}