from math import *


def Sieve(n):
    lst = [True] * (n + 1)
    S = set()
    for i in range(2, ceil(sqrt(n)) + 1):
        if lst[i]:
            for j in range(2 * i, n + 1, i):
                lst[j] = False
    for i in range(2, n + 1):
        if lst[i]:
            S.add(i)
    return S


N, L = map(int, input().split())
S = Sieve((10 ** 7 + 5)//2)
ans = 0
for s in S:
    ans += max(0, L - s * (N - 1) + 1)
print(ans)