def fast_exponentiation(a, b, n):
    result = 1
    a %= n
    while b > 0:
        if b % 2 == 1:
            result = (result * a) % n
        a = (a * a) % n
        b //= 2
    return result

for _ in range(int(input())):
    n, m = map(int, input().split())
    k=n % (2 * m)
    if k>m:
        l=k-m
        k=m
        print((fast_exponentiation(10, k, 998244353)- fast_exponentiation(10, l, 998244353))%998244353)
    else:
        print((fast_exponentiation(10, k, 998244353)-1)%998244353)
    #print((10**n-1)%(10**m+1)%998244353)