#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
constexpr ld eps = 1e-10;
int main() {
	int n, m;
	cin >> n >> m, n--;
	ll res = 0;
	for (int p = -m; p <= m; p++) {
		ld v = (ld) p / (n + 1);
		if (n % 2 == 0) {
			if (p <= 0) res += m * 2 + 1;
			else {
				ld x = exp(log(v) / n);
				ld l = pow(v, ld(n + 1) / n) - p * x, r = -l;
				l = ceil(l - eps), r = floor(r + eps);
				l = max<ld>(l, -m), r = min<ld>(r, m);
				res += (int) round(l + m) + (int) round(m - r);
			}
		} else {
			ld x = (v >= 0 ? exp(log(v) / n) : -exp(log(-v) / n));
			ld t = pow(x, n + 1);
			if (fabs(t - round(t)) < eps && (ll) round(t) >= -m && (ll) round(t) <= m) res++;
		}
	}
	cout << res << "\n";
	return 0;
}