E. Sum of Remainderstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard 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 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.InputThe only line contains two integers n, m (1 ≤ n, m ≤ 1013) — the parameters of the sum.OutputPrint integer s — the value of the required sum modulo 109 + 7.ExamplesInput3 4Output4Input4 4Output1Input1 1Output0
Input3 4
Output4
['implementation', 'math', 'number theory', '*2200']