#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
const ll mod = 998244353;
// cope counter = 2254
#pragma GCC optimize("Ofast,unroll-loops")

ll n, m, ans, cd;
inline void bk(ll a, ll b, ll c, ll d, ll i) {
	cd = c ? (m - d) / c : 1e9;
	ans += min(a ? (n - b) / a : (ll)1e9, cd) - i + 1 + max(min(a ? (m - b) / a : (ll)1e9, cd) - i + 1, 0ll);
	ll j = 1;
	while(1) {
		if(a * max(i, j) + b > m || (c + 2 * a * j) * max(i, j) + d + 2 * b * j > n) break;
		bk(c + 2 * a * j, d + 2 * b * j, a, b, max(i, j));
		j++;
	}
}
inline void kb(ll a, ll b, ll i) {
	ll j = 1;
	while(1) {
		if(b + 2 * j * a > m || a + 2 * max(i, j + 1) * (b + 2 * j * a) > n) break;
		kb(b + 2 * j * a, a, max(i, j + 1));
		j++;
	}
	bk(2 * a, b, 0, a, i);
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	if(n < m) swap(n, m);
	kb(1, 0, 1);
	cout << ans << "\n";
}