#include<bits/stdc++.h>
using namespace std;
#define mod 998244353
#define N 100010
#define LL long long
int n,t,k;
LL g[N],f[N];
int main(){
scanf("%d",&t);
g[1]=1,f[1]=8;
for(int i=2;i<=N;i++){
f[i]=(9*f[i-1]+g[i-1])%mod;
g[i]=(9*g[i-1]+f[i-1])%mod;
}
while(t--){
scanf("%d%d",&n,&k);
if(n==1){
printf("9\n");
continue;
}
printf("%lld\n",f[n]%mod);
}
return 0;
}