def sieve(n):
    s = [True] * n
    for x in range(2, int(n ** 0.5) + 1):
        if s[x]:
            for i in range(x + x, n, x):
                s[i] = False
    return [i for i in range(n) if s[i] and i > 1]


def solve():
    N, L = map(int, input().split())

    ps = sieve(L // (N - 1) + 1)

    ans = 0
    for p in ps:
        a = L - p * (N - 1)
        ans += a + 1
    print(ans)


if __name__ == '__main__':
    solve()