import bisect
a=[[[]for _ in range(9)]for _ in range(15)]
a[0]=[[i+1] for i in range(9)]
b={i for i in range(1,10)}
for i in range(1,15):
	for j in range(9):
		for k in range(j,9):
			for l in a[i-1][j]:
				a[i][k].append(l*10+k+1)
				b.add(l*10+k+1)
b=sorted(list(b))
mod=998244353
for _ in range(int(input())):
	n=int(input())+1
	x=b[bisect.bisect_left(b,n)]-n 
	ans=0
	ans+=8*(pow(10,x//8,mod)-1)*pow(9,mod-2,mod)
	ans+=(x%8)*pow(10,x//8,mod)
	ans+=(pow(10,n,mod)-1)*pow(9,mod-2,mod)
	ans%=mod 
	print(ans)