N, M = map(int, input().split())


def divisors(n):
    divs = []
    for i in range(1, int(n**0.5) + 1):
        if n % i == 0:
            divs.append(i)
            if i != n // i:
                divs.append(n // i)
    return divs


val = 0
ans = val

for x in range(1, N + 1):
    diff = M - sum([d for d in divisors(x) if d <= M])
    val += diff
    ans = max(ans, val)

print(ans)