4581 E
时间限制1 S
内存限制128 MB
通过率0%(0 / 0)
题目描述
如果一个数字除以 11 euqals 0 或它包含数字 k，我们称它为 EXcellent，有关详细信息，请参阅示例。
现在我们想知道 [0， 10n] 之间有多少个卓越数字？
Since this number can be very large, print the remainder when it’s divided by lovely 998244353.
输入格式
The first line contains an integer T(T ≤ 10) — the number of test cases you need to solve.
The only line of each test case contains 2 integer n, k(1 ≤ n ≤ 106, 1 ≤ k ≤ 2 × 105) without leading zeros. test case, print the result mod lovely 998244353.
输出格式
For each test case, print the result mod lovely 998244353.
输入输出样例
输入复制
3
1 1
2 12
666 233输出复制
3
11
828654121数据范围与提示
In the first example, there are 0,1,10 In the second example, there are 0,11,12,22,33,44,55,66,77,88,99
来源