Takahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten. He remembers that the remainder of a divided by b was greater than or equal to K. Find the number of possible pairs that he may have had.
N, K = list(map(int, input().split()))

cnt = 0
for a in range(K, N+1):
    for b in range(K, a+1):
        if a == 0 or b == 0:
            continue
        if ((a%b) >= K):
            print(a,b)
            cnt += 1
            print(cnt)

print(cnt)

cnt += 0.5*(N**2 - 2*N*K - N + K**2 + K)
print(int(cnt))

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

cnt = 0
for b in range(1, N+1):
    p = N // b
    q = N % b
    cnt += max(b-K,0)*p + max(q+1-K,0)
if K == 0:
    cnt -= N
print(int(cnt))