N, K = list(map(int, input().split()))

ans = 0

for b in range(1, N + 1):

    p, r = divmod(N, b)

    ans += p * max(0, b - K) + max(0, r - K + 1)

if K == 0:

    ans -= N

print(ans)
N, K = list(map(int, input().split()))

if K == 0:

    print((N * N))

    exit()

cnt = 0

for b in range(K + 1, N + 1):

    p, r = divmod(N, b)

    cnt += p * (b - K)

    if r >= K:

        cnt += r - K + 1

print(cnt)
N, K = list(map(int, input().split()))
ans = 0
for b in range(1, N + 1):
    p, r = divmod(N, b)
    ans += p * max(0, b - K) + max(0, r - K + 1)
if K == 0:
    ans -= N
print(ans)

N, K = list(map(int, input().split()))
if K == 0:
    print((N * N))
    exit()
cnt = 0
for b in range(K + 1, N + 1):
    p, r = divmod(N, b)
    cnt += p * (b - K)
    if r >= K:
        cnt += r - K + 1
print(cnt)

-ans = 0 -for b in range(1, N + 1): +if K == 0: +    print((N * N)) +    exit() +cnt = 0 +for b in range(K + 1, N + 1): -    ans += p * max(0, b - K) + max(0, r - K + 1) -if K == 0: -    ans -= N -print(ans) +    cnt += p * (b - K) +    if r >= K: +        cnt += r - K + 1 +print(cnt)