#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

ll n, m, ans;
inline ll gay(ll a, ll b) {
	return a / max(b, 1ll);
}
inline void bk(ll a, ll b, ll c, ll d, ll i) {
	ans += max(min(gay(n - b, a), gay(n - d, c)) - i + 1, 0ll) + max(min(gay(n - b, a), gay(m - d, c)) - i + 1, 0ll);
	for(ll j = 1; a * max(i, j) + b <= m && (c + 2 * a * j) * max(i, j) + d + 2 * b * j <= n; j++) {
		bk(c + 2 * a * j, d + 2 * b * j, a, b, max(i, j));
	}
}
inline void kb(ll a, ll b, ll i) {
	for(ll j = 1; b + 2 * j * a <= m && a + 2 * max(i, j + 1) * (b + 2 * j * a) <= n; j++) kb(b + 2 * j * a, a, max(i, j + 1));
	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";
}