Remainders#11403

Remainders

1 second

128 megabytes

Medium

After Fuad got acquainted with the remainder operator, he thought about the next mathematical problem. He wonders how to compute $(n m o d 1) + (n m o d 2) + \dots + (n m o d m)$ (n~mod~1) + (n~mod~2) + \ldots + (n~mod~m).

Here $m o d$ represents the remainder operator and $(x m o d y)$ (x~mod~y) represents the remainder obtained when $x$ is divided by $y$ . For example $(8 m o d 3) = 2$ (8~mod~3) = 2.

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

Input

Two integers $n$ and $m (1 \leq n, m \leq 2 \cdot 1 0^{9})$ m~(1 \le n, m \le 2 \cdot 10^9).

Output

Print the value of the given expression.

Examples

Example 1

Loading

Example 2

Loading

Example 3

Loading

(n m o d 1) + (n m o d 2) + \dots + (n m o d m)

(x m o d y)

(8 m o d 3) = 2

m (1 \leq n, m \leq 2 \cdot 1 0^{9})