#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int verif(int a, int b) {
	if (gcd(a,b) != 1) return 0;
	while (1) {
		if (a < b) swap(a,b);
		if (2*b > a) return 0;
		a %= 2*b;
		if (a == 0) return 1;
	}
}

signed main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	
	freopen("fraction.in", "r", stdin);
	freopen("fraction.out", "w", stdout);
	
	int n, m; cin >> n >> m;
	
	int cnt = 0;
	
	for (int i=1; i<=n; i++) {
		for (int j=1; j<=m; j++) {
			cnt += verif(i,j);
		}
	}
	
	cout<<cnt;
	
	return 0;
}