eolymp
bolt
Try our new interface for solving problems
Problems

Remainders

Remainders

Time limit 1 second
Memory limit 128 MiB

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

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

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

Input data

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

Output data

Print the value of the given expression.

Examples

Input example #1
5 3
Output example #1
3
Input example #2
3 3
Output example #2
1
Input example #3
1 1
Output example #3
0
Source 2023 Azerbaijan, Semifinals, February 18, 10 - 11 classes