#include <iostream>
using namespace std;
using ll = long long;
int mod = 998244353;

int N, M;
void solve(){
    cin >> N >> M;
    N %= 2 * M;
    if(N < M){
        ll ans = 0;
        for(int i = 0;i < N;i++)ans = (ans * 10 + 9) % mod;
        cout << ans << "\n";
        return;
    }
    ll ans = 0;
    for(int i = 0;i < M - (N - M);i++)ans = (ans * 10 + 9) % mod;
    for(int i = 0;i < N - M;i++)ans = (ans * 10) % mod;
    cout << ans << "\n";
}
int main(void){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t; cin >> t;
    while(t--)solve();
    return 0;
}