Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
E. Sum of Remainders

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputCalculate 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 10^{9} + 7 (the remainder when divided by 10^{9} + 7).

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

Input

The only line contains two integers *n*, *m* (1 ≤ *n*, *m* ≤ 10^{13}) — the parameters of the sum.

Output

Print integer *s* — the value of the required sum modulo 10^{9} + 7.

Examples

Input

3 4

Output

4

Input

4 4

Output

1

Input

1 1

Output

0

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/09/2021 14:46:03 (j2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|