We call a number EXcellent if it divided by $11$ euqals $0$ or it contains the number $k$, see sample for details.

Now we want to know how many EXcellent numbers are between $[0, 10^n]$?

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 \leq 10)$ — the number of test cases you need to solve.

The only line of each test case contains 2 integers $n, k(1 \leq n \leq 10^6,1 \leq k \leq 2 \times 10^5)$ without leading zeros.

For each test case, print the result mod lovely $998244353$.

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$