n,m=map(int,input().split())
D=[0]+[m]*n
for i in range(1,m+1):
    for j in range(0,n+1,i):
        D[j]-=i
D=D[1:]
for i in range(1,len(D)):
    D[i]+=D[i-1]
print(max(D))