My pretty girl Noora
Contest: Codeforces Round 422 (Div. 2)
Difficulty rating: 1800
Tags: brute force, dp, greedy, math, number theory

In Pavlopolis University where Noora studies it was decided to hold beauty contest "Miss Pavlopolis University". Let's describe the process of choosing the most beautiful girl in the university in more detail.

The contest is held in several stages. Suppose that exactly n girls participate in the competition initially. All the participants are divided into equal groups, x participants in each group. Furthermore the number x is chosen arbitrarily, i. e. on every stage number x can be different. Within each group the jury of the contest compares beauty of the girls in the format "each with each". In this way, if group consists of x girls, then $$\frac{x \cdot (x-1)}{2}$$ comparisons occur. Then, from each group, the most beautiful participant is selected. Selected girls enter the next stage of the competition. Thus if n girls were divided into groups, x participants in each group, then exactly $$\frac{\pi}{\tau}$$ participants will enter the next stage. The contest continues until there is exactly one girl left who will be "Miss Pavlopolis University"

But for the jury this contest is a very tedious task. They would like to divide the girls into groups in each stage so that the total number of pairwise comparisons of the girls is as few as possible. Let f(n) be the minimal total number of comparisons that should be made to select the most beautiful participant, if we admit n girls to the first stage.

The organizers of the competition are insane. They give Noora three integers t, l and r and ask the poor girl to calculate the value of the following expression: t0·f(l) + t1·f(l + 1) + ... + tr - l·f(r). However, since the value of this expression can be quite large the organizers ask her to calculate it modulo 109 + 7. If Noora can calculate the value of this expression the organizers promise her to help during the beauty contest. But the poor girl is not strong in mathematics, so she turned for help to Leha and he turned to you.

Input format:
The first and single line contains three integers t, l and r (1 ≤ t < 109 + 7, 2 ≤ l ≤ r ≤ 5·106).

Output format:
In the first line print single integer — the value of the expression modulo 109 + 7.

Constraints:
Time limit: 1.5 s
Memory limit: 256.0 MB

Note:
Consider the sample.

It is necessary to find the value of $$( 2 ^ { 0 } \cdot f ( 2 ) + 2 ^ { 1 } \cdot f ( 3 ) + 2 ^ { 2 } \cdot f ( 4 ) ) \bmod ( 1 0 ^ { 9 } + 7 )$$.

f(2) = 1. From two girls you can form only one group of two people, in which there will be one comparison.

f(3) = 3. From three girls you can form only one group of three people, in which there will be three comparisons.

f(4) = 3. From four girls you can form two groups of two girls each. Then at the first stage there will be two comparisons, one in each of the two groups. In the second stage there will be two girls and there will be one comparison between them. Total 2 + 1 = 3 comparisons. You can also leave all girls in same group in the first stage. Then $$\frac{4 \cdot 3}{2} = 6$$ comparisons will occur. Obviously, it's better to split girls into groups in the first way.

Then the value of the expression is $$( 2 ^ { 0 } \cdot 1 + 2 ^ { 1 } \cdot 3 + 2 ^ { 2 } \cdot 3 ) \mod ( 1 0 ^ { 9 } + 7 ) = 1 9$$.

Example input:
2 2 4

Example output:
19

Editorial:
Suppose we have already calculated f(2), f(3), ..., f(r). Then calculating the value of the expression is easy.
Consider process of calculating f(x). Suppose we found optimal answer. Represent this answer as sequence of integers d1, d2, ..., dk — on the first stage we will divide girls into groups of d1 participants, on the second stage into groups of d2 participants and so on. Let us prove that all di should be prime.
Suppose some di is a composite number. Then it can be decomposed into two numbers di = a·b. In addition, let n girls are admitted to the i-th stage. Then on current i-th stage $$\frac{n}{d_i} \cdot \frac{d_i \cdot (d_i - 1)}{2} = \frac{n \cdot (d_i - 1)}{2}$$ comparisons will occur. But if we divide this stage into two new stages, then number of comparisons is $$\frac{n\cdot(a-1)}{2}+\frac{n\cdot(b-1)}{2\cdot a}\leq\frac{n\cdot(a-1)}{2}+\frac{n\cdot(b-1)}{2}\leq\frac{n\cdot(a+b-2)}{2}\leq\frac{n\cdot(ab-1)}{2}=\frac{n\cdot(d_{i}-1)}{2}$$. So, we proved that all di should be prime. Then it's easy to write DP which will be calculated by transition from the state to the states given by dividing current state by prime divisors. For solving this task we can use Eratosthenes sieve.
Total complexity is same as complexity of Eratosthenes sieve: $${ \mathcal { O } } ( r \log \log r )$$.
In addition you can prove the fact that we should split the girls into groups by prime numbers in the order of their increasing. This optimization significantly accelerates the algorithm.