/*蛋糕鱼乐园*/
#include <bits/stdc++.h>
#define lowbit(x) (x & (-x))
using namespace std;

int n, m; long long ans;
inline void dfs1(int a, int b, int c, int d, int minn)
{
	ans += max(0, min(((!a) ? m : ((n - b) / a)), (m - d) / c) - minn + 1) + max(0, (n - d) / c - minn + 1);
	for(int i = 1; ; ++i)
	{
		int A = 2 * i * c + a, B = 2 * i * d + b;
		int lim = max(minn, i + 1);
		if(1ll * lim * A + B > m) break;
		dfs1(c, d, A, B, lim);
	}
}
inline void dfs2(int a, int b, int minn)
{
	for(int i = 1; ; ++i)
	{
		int c = 2 * i * b + a;
		if(max(minn, i) * 2ll * c + b > m) break;
		dfs2(b, c, max(minn, i));
	}
	dfs1(0, b, 2 * b, a, minn);
}

int main()
{
//	freopen("text.in", "r", stdin);
//	freopen("prog.out", "w", stdout);
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	cin >> n >> m;
	if(n > m) swap(n, m);
	dfs1(0, 1, 2, 0, 1);
	for(int i = 1; 4 * i * i + 1 <= m; ++i) dfs2(1, 2 * i, i);
	cout << ans << '\n';
	return 0;
}

/*

*/