#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 998244353;

ll modpow(ll base, ll exp, ll mod) {
    ll res = 1;
    while (exp > 0) {
        if (exp % 2 == 1) res = res * base % mod;
        base = base * base % mod;
        exp /= 2;
    }
    return res;
}

void solve() {
    ll N, M;
    cin >> N >> M;
    ll mod_val = 10 * modpow(10, M, MOD) + 1;
    ll r = N % (2 * M);
    
    if (r == 0) {
        cout << 0 << '\n';
        return;
    }
    
    ll result = (modpow(10, r, mod_val) - 1 + mod_val) % mod_val;
    cout << result % MOD << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int T;
    cin >> T;
    while (T--) {
        solve();
    }
}