#include <bits/stdc++.h>
using std::bitset;
using std::cout;
using std::deque;
using std::endl;
using std::greater;
using std::lower_bound;
using std::make_pair;
using std::map;
using std::max;
using std::min;
using std::multimap;
using std::multiset;
using std::nth_element;
using std::pair;
using std::priority_queue;
using std::queue;
using std::reverse; 
using std::set;
using std::sort;
using std::sqrt;
using std::stable_sort;
using std::string;
using std::swap;
using std::unique;
using std::upper_bound;
using std::vector;
typedef int li;
typedef long double lf;

inline li read(){
	li ans = 0, f = 1;
	char ch = getchar();
	while(ch < '0' || ch > '9'){
		f = (ch == '-') ? -1 : 1;
		ch = getchar();
	}
	while(ch <= '9' && ch >= '0'){
		ans = ans * 10 + (ch ^ 48);
		ch = getchar();
	}
	return ans * f;
} 

li n, m;
long long ans;

void dfs2(li a, li b, li c, li d, li v){
	li sum = max(0, (n - d) / c - v + 1);
	sum += max(0, min(!a ? m : (n - b) / a, (m - d) / c) - v + 1);
	ans += sum;
	for(li u = 1; u; u++){
		li A = 2 * c * u + a, B = 2 * d * u + b;
		if(1ll * A * max(u + 1, v) + B > m) break;
		dfs2(c, d, A, B, max(v, u + 1));
	}
}

void dfs1(li a, li b, li v){
	for(li u = 1; u; u++){
		li c = 2 * u * b + a;
		if(2ll * c * max(u, v) + b > m) break;
		dfs1(b, c, max(u, v));
	}
	dfs2(0, b, 2 * b, a, v);
}

int main(){
//	freopen("wonderful.ans", "r", stdin);
//	freopen("www.ww", "w", stdout);
	n = read(), m = read();
	if(n > m) swap(n, m);	
	dfs2(0, 1, 2, 0, 1);
	for(li i = 1; 4 * i * i + 1 <= m; i++) dfs1(1, 2 * i, i);
	printf("%lld\n", ans);
	return 0;
}