#include <iostream>
#include <atcoder/modint>
using namespace std;
using ll = long long;
using mint = atcoder::modint998244353;

int N, M;
void solve(){
    cin >> N >> M;
    N %= 2 * M;
    if(N < M){
        cout << (mint::raw(10).pow(N) - 1).val() << "\n";
        return;
    }
    cout << ((mint::raw(10).pow(M - (N - M)) - 1) * mint::raw(10).pow(N - M)).val() << "\n";
}
int main(void){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t; cin >> t;
    while(t--)solve();
    return 0;
}