时间限制：C/C++/Rust/Pascal 2秒，其他语言4秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
题目描述
We call a number EXcellent if it divided by euqals
or it contains the number
, see sample for details.
Now we want to know how many EXcellent numbers are between ?
Since this number can be very large, print the remainder when it's divided by lovely .
输入描述:
The first line contains an integer
— the number of test cases you need to solve.
The only line of each test case containsinteger
without leading zeros.
输出描述:
For each test case, print the result mod lovely.