#include <fstream>
//#include <vector>

using namespace std;

ifstream in("mins.in");
ofstream out("mins.out");

//int l[1000001], w[1000001];
//vector<int> prime;
//
//void do_p() {
//	for (int i = 2; i <= 1000000; i++) {
//		if (l[i] == 0) {
//			l[i] = i;
//			prime.push_back(i);
//			w[i] = prime.size() - 1;
//		}
//		for (int j = w[l[i]]; j >= 0 && 1ll * i * prime[j] <= 1000000; j--) {
//			l[i * prime[j]] = prime[j];
//		}
//	}
//}

bool coprime(int a, int b) {
	int r;
	while (b) {
		r = a % b;
		a = b;
		b = r;
	}
	return (a == 1 ? 1 : 0);
}

int main() {
	//do_p();
	int c, d, ans = 0;
	in >> c >> d;
	for (int i = 1; i <= c - 1; i++) {
		for (int j = 1; j <= d - 1; j++) {
			if (!coprime(i, j))
				continue;
			ans++;
		}
	}
	out << ans;
	return 0;
}