#yukicoder424A Simple Math(Returned)

MOD = 998244353

#実験
def brute(N, M):
    return ((10 ** N - 1) % (10 ** M + 1)) % MOD
    
#見えた規則性に沿って実装
def brute2(N, M):
    N %= 2 * M
    if N <= M:
        return (10 ** N - 1) % MOD
    else:
        return (10 ** M - 10 ** (N - M)) % MOD

def solve(N, M):
    N %= 2 * M
    if N <= M:
        return (pow(10, N, MOD) - 1) % MOD
    else:
        return (pow(10, M, MOD) - pow(10, N - M, MOD)) % MOD
    
for _ in range( int(input()) ):
    N, M = map(int, input().split())
    print( solve(N, M) )