import sys
input = sys.stdin.readline

# def naive(N, M):
#     return (10 ** N - 1) % (10 ** M + 1) % mod

T = int(input())
mod = 998244353
for _ in range(T):
    N, M = map(int, input().split())
    N %= 2 * M
    if N >= M:
        ans = - pow(10, N - M, mod) + pow(10, M, mod)
    else:
        ans = pow(10, N, mod) - 1
    
    # assert ans == naive(N, M)
    print(ans % mod)