from math import sqrt

def solve():
    n, l = map(int, input().split())
    ans = 0
    primes = ()
    i = 2
    while i < (l // (n - 2) + 1):
        for j in primes:
            if i % j == 0:
                break
        else:
            primes = primes + (i,)
            if (l + 1) < (n - 1) * i:
                break
            ans += (l + 1) - (n - 1) * i
        i += 1
    print(ans)

if __name__=="__main__":
    solve()