#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return vector(arg, init);
    else return vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename Container>
auto distance(const Container &c, decltype(begin(c)) iter) {
    return distance(begin(c), iter);
}

template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>>
auto isort(RIter first, RIter last, Compare comp = Compare()) {
    vector<int> i(distance(first, last));
    iota(begin(i), end(i), 0);
    sort(begin(i), end(i), [&](auto x, auto y) {
        return comp(*(first + x), *(first + y));
    });
    return i;
}

template <typename, template <typename> typename, typename = void_t<>>
struct detect : false_type {};
template <typename T, template <typename> typename Check>
struct detect<T, Check, void_t<Check<T>>> : true_type {};
template <typename T, template <typename> typename Check>
constexpr inline bool detect_v = detect<T, Check>::value;

template <typename T>
using has_member_sort = decltype(declval<T>().sort());

template <typename Container, typename Compare = less<typename Container::value_type>>
auto sorted(Container c, Compare comp = Compare()) {
    if constexpr (detect_v<Container, has_member_sort>) {
        c.sort(comp);
        return c;
    }
    else {
        sort(begin(c), end(c), comp);
        return c;
    }
}

template <typename Container, typename Compare = equal_to<typename Container::value_type>>
auto uniqued(Container c, Compare comp = Compare()) {
    c.erase(unique(begin(c), end(c), comp), end(c));
    return c;
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

template <typename F>
constexpr auto fix(F &&f) noexcept {
    return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable {
        return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);
    };
}

#include <atcoder/modint>
using mint = atcoder::modint998244353;

int main() {
    constexpr auto log = 19;

    int t; cin >> t;

    while (t--) {
        int64_t n; cin >> n;
        int x; cin >> x;

        auto dp = vec<mint>(0, 2, 2, log + 1, log + 1, 2);

        dp[0][0][0][0][0] = 1;
        dp[0][1][0][0][0] = 1;
        dp[1][0][0][0][0] = 1;
        dp[1][1][0][0][0] = 1;

        for (int i = 1; i <= log; ++i) {
            const int d = (n % 10); n /= 10;

            for (int j = 0; j <= i; ++j) {
                for (int k = 0; k <= (0 < j); ++k) {
                    for (int a = 0; a < 10; ++a) {
                        for (int b = 0; b < 10; ++b) {
                            for (int c = 0; c < 2; ++c) {
                                if ((10 <= a + b + c) != k) {
                                    continue;
                                }

                                dp[0][0][i][j][k] += dp[0][0][i - 1][j - k][c];

                                if (a < d && b < d) {
                                    dp[0][1][i][j][k] += dp[0][0][i - 1][j - k][c];
                                    dp[1][0][i][j][k] += dp[0][0][i - 1][j - k][c];
                                    dp[1][1][i][j][k] += dp[0][0][i - 1][j - k][c];
                                }
                                if (a == d && b < d) {
                                    dp[0][1][i][j][k] += dp[0][0][i - 1][j - k][c];
                                    dp[1][0][i][j][k] += dp[1][0][i - 1][j - k][c];
                                    dp[1][1][i][j][k] += dp[1][0][i - 1][j - k][c];
                                }
                                if (a > d && b < d) {
                                    dp[0][1][i][j][k] += dp[0][0][i - 1][j - k][c];
                                }

                                if (a < d && b == d) {
                                    dp[0][1][i][j][k] += dp[0][1][i - 1][j - k][c];
                                    dp[1][0][i][j][k] += dp[0][0][i - 1][j - k][c];
                                    dp[1][1][i][j][k] += dp[0][1][i - 1][j - k][c];
                                }
                                if (a == d && b == d) {
                                    dp[0][1][i][j][k] += dp[0][1][i - 1][j - k][c];
                                    dp[1][0][i][j][k] += dp[1][0][i - 1][j - k][c];
                                    dp[1][1][i][j][k] += dp[1][1][i - 1][j - k][c];
                                }
                                if (a > d && b == d) {
                                    dp[0][1][i][j][k] += dp[0][1][i - 1][j - k][c];
                                }

                                if (a < d && b > d) {
                                    dp[1][0][i][j][k] += dp[0][0][i - 1][j - k][c];
                                }
                                if (a == d && b > d) {
                                    dp[1][0][i][j][k] += dp[1][0][i - 1][j - k][c];
                                }
                            }
                        }
                    }
                }
            }
        }

        cout << dp[1][1][log][x][0].val() << endl;
    }
}