#include <stdio.h>
#include <math.h>
#pragma warning(disable: 4996)
#include <time.h>
inline int max(int a, int b) {
    return a > b ? a : b;
}

int n = 0;
int m = 0;
int p = 0;
int q = 0;

double f(double x) {
    return pow(x, n) + x * (double)p;
}

double fprime(double x) {
    return (double)n * pow(x, (double)n - 1) + (double)p;
}

int main()
{
    scanf("%d %d", &n, &m);
    long long ans = 0;
    if (n % 2 == 1) { // 홀수차수
        ans += (long long int)(m + 1) * (long long int)(2 * m + 1);
        for (int i = 1; i <= m; i++) {
            p = -i;
            double root = pow((double)i / n, 1 / ((double)n - 1));
            double crit = f(root);
            //printf("%lf\n", root);
            //printf("%lf\n", crit);
            //printf("%d\n", ans);
            //ans += 2 * max(m - ceil(-crit+1e-8) + 1, 0);
            //printf("%d\n", 2 * max(m - ceil(-crit+1e-8) + 1, 0));
            for (int j = max((int)(-crit-2), 0); j <= m; j++) {
                if (j > -crit) {
                    ans += 2 * (m - j + 1);
                    break;
                }
            }
        }
    }
    else if (n == 2) {
        ans += 1;
        for (int i = 1; i <= 1000; i++) {
            if (abs(2 * i) <= m && i * i <= m) {
                ans += 2;
            }
        }
    }
    else {
        ans += 1;
        for (int i = 1; i <= m; i++) {
            p = -i;
            double root = pow((double)i / n, 1 / ((double)n - 1));
            double crit = f(root);
            //printf("%lf\n", crit);
            if (fabs(crit - (int)(crit)) < 1e-9 && fabs(crit) <= m) {
                ans += 2;
            }

        }
    }
    printf("%lld\n", ans);
}