def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            dp[i]+=1
            if i != n // i:
                divisors.append(n//i)
                dp[n//i] +=1
    divisors.sort
    return divisor
    
    
def make_divisors2(n,m):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if i > m: break
        if n % i == 0:
            divisors.append(i)
            dp[i]+=1            
            if i != n // i:
                divisors.append(n//i)
                dp[n//i] +=1    
             
    return divisors
   
N,M= map(int, input().split()) 
dp=[[0] for i in range(N**0.5)]
divs = make_divisors(N)
for div in divs:
    a=make_divisors2(div)
ans=0
for idx,d in enumerate(dp):
    ans+=idx*d
    
print(ans)