#P9651. [SNCPC2019] Digit Product
[SNCPC2019] Digit Product
题目描述
Define the ''digit product'' of a positive integer as the product of all its digits. For example, , and .
Given two integers and , please calculate the following value:
In case that you don't know what represents, the above expression is the same as
$$(f(l) \times f(l+1) \times \dots \times f(r)) \mod (10^9+7) $$输入格式
There are multiple test cases. The first line of the input contains an integer (about ), indicating the number of test cases. For each test case:
The first and only line contains two integers and (), indicating the given two integers. The integers are given without leading zeros.
输出格式
For each test case output one line containing one integer indicating the answer.
2
1 9
97 99
362880
367416
提示
For the first sample test case, the answer is .
For the second sample test case, the answer is $(f(97) \times f(98) \times f(99)) \mod (10^9+7) = (9 \times 7 \times 9 \times 8 \times 9 \times 9) \mod (10^9+7) = 367416$.