#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
constexpr int INF = 1e9;
constexpr ll LINF = 1e18;
string YesNo(bool cond) {
    return cond ? "Yes" : "No";
}
string YESNO(bool cond) {
    return cond ? "YES" : "NO";
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template <typename T, class F>
T bisect(T ok, T ng, const F& f) {
    while (abs(ok - ng) > 1) {
        T mid = min(ok, ng) + (abs(ok - ng) >> 1);
        (f(mid) ? ok : ng) = mid;
    }
    return ok;
}
template <typename T, class F>
T bisect_double(T ok, T ng, const F& f, int iter = 100) {
    while (iter--) {
        T mid = (ok + ng) / 2;
        (f(mid) ? ok : ng) = mid;
    }
    return ok;
}
template <class T>
vector<T> make_vec(size_t a) {
    return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        is >> v[i];
    }
    return is;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        os << v[i];
        if (i < sz(v) - 1) os << ' ';
    }
    return os;
}
#include <atcoder/modint>
using mint = atcoder::modint998244353;
map<tuple<ll, ll, ll, ll>, mint> cache;
mint dp(ll a, ll b, ll carry, ll x) {
    if (cache.count({a, b, carry, x})) return cache[{a, b, carry, x}];
    if (a < 0 || b < 0 || x < 0) return 0;
    if (a == 0 && b == 0) return x == 0;
    mint ret = 0;
    for (int c = 0; c < 10; c++) {
        for (int d = 0; d < 10; d++) {
            ll na = a / 10 - (c > a % 10);
            ll nb = b / 10 - (d > b % 10);
            ll ncarry = c + d + carry >= 10;
            ll nx = x - ncarry;
            // cerr << c << ' ' << d << ' ' << ncarry << '\n';
            ret += dp(na, nb, ncarry, nx);
        }
    }
    return cache[{a, b, carry, x}] = ret;
}
int main() {
    int tt;
    cin >> tt;
    while (tt--) {
        ll n, x;
        cin >> n >> x;
        cout << dp(n, n, 0, x).val() << '\n';
    }
}