#P616E. Sum of Remainders

    ID: 3414 Type: RemoteJudge 2000ms 256MiB Tried: 0 Accepted: 0 Difficulty: (None) Uploaded By: Tags>implementationmathnumber theory*2200

Sum of Remainders

No submission language available for this problem.

Description

Calculate the value of the sum: n mod 1 + n mod 2 + n mod 3 + ... + n mod m. As the result can be very large, you should print the value modulo 109 + 7 (the remainder when divided by 109 + 7).

The modulo operator a mod b stands for the remainder after dividing a by b. For example 10 mod 3 = 1.

The only line contains two integers n, m (1 ≤ n, m ≤ 1013) — the parameters of the sum.

Print integer s — the value of the required sum modulo 109 + 7.

Input

The only line contains two integers n, m (1 ≤ n, m ≤ 1013) — the parameters of the sum.

Output

Print integer s — the value of the required sum modulo 109 + 7.

Samples

3 4

4

4 4

1

1 1

0