#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

#include "atcoder/modint"

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

using mint = atcoder::modint998244353;

void solve() {
    ll N;
    int X;
    cin >> N >> X;
    vector dp(3, vector(3, vector(2, vector<mint>(X + 1, 0)))), ndp(3, vector(3, vector(2, vector<mint>(X + 1, 0))));
    dp[1][1][0][0] = 1;
    for (int _ = 0; _ < 19; _++, N /= 10) {
        int n = N % 10;
        for (int i = 0; i < 3; i++) {
            for (int j = 0; j < 3; j++) {
                for (int k = 0; k < 2; k++) {
                    for (int l = 0; l <= X; l++) {
                        mint& val = dp[i][j][k][l];
                        if (val == 0) continue;
                        for (int a = 0; a < 10; a++) {
                            for (int b = 0; b < 10; b++) {
                                int ni = (a == n ? i : a > n ? 2 : 0);
                                int nj = (b == n ? j : b > n ? 2 : 0);
                                int nk = (a + b + k >= 10);
                                int nl = l + (a + b + k >= 10);
                                if (nl > X) continue;
                                ndp[ni][nj][nk][nl] += val;
                            }
                        }
                        val = 0;
                    }
                }
            }
        }
        swap(dp, ndp);
    }

    mint ans = 0;
    for (int i = 0; i < 2; i++) {
        for (int j = 0; j < 2; j++) {
            ans += dp[i][j][0][X];
        }
    }

    cout << ans.val() << '\n';
}

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