Problem Statement

Consider the following sequences.
f(1)={1}
f(2)={1,4,1}
f(3)={1,4,1,9,1,4,1}
f(n)=f(n-1) + $n^2$ + f(n-1)

Consider concatenating such a sequence into a string.
For example, f(3) becomes "1419141", and if the sequence were {9,11,10}, it would become "91110".
You are given K, L, and R.

Find the sum and the product of the digits from the L-th character to the R-th character of the string obtained from f(K).
Only the product should be reported as the remainder when divided by $1000000007$($10^9+7$).
However, if a 0 is included, the product would normally become 0, which is not interesting, so the digit "0" is treated as "10", only when calculating the sum and the product.
If the value of R exceeds the number of characters in the string obtained from f(K), output "-1".


Here are some examples.
Example 1: If f(K) is "91110" and L=2, R=5, the sum is $1+1+1+10=13$ and the product is $1*1*1*10=10$.
Example 2: If f(K) is "1419141" and L=1,R=7, the sum is $1+4+1+9+1+4+1=21$ and the product is $1*4*1*9*1*4*1=144$.
Example 3: If f(K) is "7777777" and L=4,R=5, the sum is $7+7=14$ and the product is $7*7=49$.
Incidentally, the relevant part is "1110" in Example 1, "1419141" in Example 2, and "77" in Example 3.

For reference, the strings obtained from f(1) through f(5) are as follows.
String obtained from f(1) ⇒ "1"
String obtained from f(2) ⇒ "141"
String obtained from f(3) ⇒ "1419141"
String obtained from f(4) ⇒ "1419141161419141"
String obtained from f(5) ⇒ "1419141161419141251419141161419141"

Input

K L R

・1≦K≦10^9
・1≦L≦R≦10^18

Output

On one line, output the sum of the digits from the L-th character to the R-th character of the string obtained from f(K), and the remainder of their product when divided by 1000000007, separated by a space.
Here, L and R are 1-indexed.

Sample