def power(p):
	return (baby[p%backet]*giant[p//backet])%MOD
MOD=998244353
backet=32000
baby=[1]*(backet+1)
for i in range(backet):
	baby[i+1]=(baby[i]*10)%MOD
giant=[1]*(backet+1)
for i in range(backet):
	giant[i+1]=(giant[i]*baby[-1])%MOD
T=int(input())
for i in range(T):
	N,M=map(int,input().split())
	N%=M*2
	if N<=M:
		print((power(N)-1)%MOD)
	else:
		print((power(M*2-N)-1)*power(N-M)%MOD)