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=map(int,input().split())

b=1
ans=0
while b<=n:
    p,r=divmod(n,b)
    ans+=p*max(0,b-k)+max(0,r-k+1)
    print(b,p,r)
    b+=1
if k==0:
    ans-=n
print(ans)

n,k=map(int,input().split())

b=1
ans=0
while b<=n:
    p,r=divmod(n,b)
    ans+=p*max(0,b-k)+max(0,r-k+1)
    b+=1
if k==0:
    ans-=n
print(ans)
