Remainders

After Fuad got acquainted with the remainder operator, he thought about the next mathematical problem. He wonders how to compute $(nmod1)+(nmod2)+...+(nmodm)$.

Here $mod$ represents the remainder operator and $(xmody)$ represents the remainder obtained when $x$ is divided by $y$. For example $(8mod3)=2$.

Find the value of the above expression for the given positive integers $n$ and $m$.

Input

Two integers $n$ and $m(1\le n,m\le 2\cdot 10^9)$.

Output

Print the value of the given expression.

Examples