import sys

sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# md = 10**9+7
md = 998244353

from functools import lru_cache

@lru_cache(None)
def f(a,b,m,c):
    if a==b==0:return 0
    res=0
    if c==0 or c==1:
        for d in range(min(10, a+1)):
            for e in range(min(10, b+1)):
                if d==e==0:continue
                nc=c
                if d+e+m>9:nc-=1
                if nc==0:res+=1
    a1=a%10
    b1=b%10
    for d in range(min(10,a+1)):
        for e in range(min(10,b+1)):
            nm=d+e+m>9
            if c-nm>=0:res+=f(a//10-(d>a1),b//10-(e>b1),nm,c-nm)
            res%=md

    # print(a,b,m,c,res)
    return res

for _ in range(II()):
    n,x=LI()
    ans=f(n,n,0,x)+(x==0)
    print(ans%md)