9000: World Fragments III

This problem is different from World Fragments I and World Fragments II. Please read the statements carefully.
There are $q$ queries for you to answer.
For each query, you are given two non-negative decimal integers $x$ and $y$ without leading zeros. You can apply the following operation to $x$ any number of times (possibly zero):

1. Choose a digit $b$ in $x$.
   
2. Let either $x\leftarrow x+b$ or $x\leftarrow x-b$.
   

For example, when x=(616)10x = (616)_{10}x=(616)10 you can choose the digit b=(1)10b=(1)_{10}b=(1)10 in (61‾6)10(6\underline{1}6)_{10}(616)10, then let x←x−b=(616)10−(1)10=(615)10x \gets x - b = (616)_{10} - (1)_{10} = (615)_{10}x←x−b=(616)10−(1)10=(615)10.
Find out the least number of operations needed to turn $x$ into $y$. Since the answer can be very large, output it modulo $998244353$. Print $-1$ if it is impossible to turn $x$ into $y$.

The first line contains a positive integer $T$ (1≤T≤1031\leq T\leq 10^31≤T≤103) — the number of queries.
Each query consists of a line that contains two integers x,yx, yx,y (0≤x≤y≤101060\leq x\le y\leq 10^{10^{6}}0≤x≤y≤10106). Please note that in this version, $x\le y$.
It is guaranteed that the sum of the lengths of the decimal representations of all $y$s does not exceed 2×1062\times10^{6}2×106.

For each query, print a decimal integer in a single line, denoting the answer modulo $998244353$. If it is impossible to turn $x$ into $y$, print $-1$.