#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> P;
#define REP(i,n) for(int i=0;i<int(n);i++)


const ll MOD=998244353;

ll modpow(ll x,ll n){
    ll res=1;
    while(n!=0LL){
	if(n%2!=0LL) res=(res*x)%MOD;
	x=(x*x)%MOD;
	n/=2;
   }
    return res;
}



int main(){
	cin.tie(nullptr);  ios_base::sync_with_stdio(false);
    int i,j,k;


    int T;
     cin >> T;
     while(T--){

    	 ll M,N;
    	 cin >> N >> M;


    	 ll x=N%(2*M);

    	 ll a=(modpow(10,x)-1+MOD)%MOD;
    	 ll b=(2*MOD-modpow(10,x-M)-1)%MOD;

    	 if(x<M) cout << a << endl;
    	 else cout << b << endl;


     }



	return 0;

}