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

using i64 = long long;
using u64 = unsigned long long;

template <int P>
struct Modint {
    int v;

    constexpr Modint() : v(0) {}
    constexpr Modint(i64 v_) : v(v_ % P) {
        if (v < 0) {
            v += P;
        }
    }
    constexpr explicit operator int() const { return v; }
    constexpr friend ostream& operator<<(ostream &out, Modint n) {
        return out << int(n);
    }
    constexpr friend istream& operator>>(istream &in, Modint &n) {
        i64 v;
        in >> v;
        n = Modint(v);
        return in;
    }

    constexpr friend bool operator==(Modint a, Modint b) {
        return a.v == b.v;
    }
    constexpr friend bool operator!=(Modint a, Modint b) {
        return a.v != b.v;
    }

    constexpr Modint operator-() {
        Modint res;
        res.v = v ? P - v : 0;
        return res;
    }

    constexpr Modint& operator++() {
        v++;
        if (v == P) v = 0;
        return *this;
    }
    constexpr Modint& operator--() {
        if (v == 0) v = P;
        v--;
        return *this;
    }
    constexpr Modint& operator+=(Modint o) {
        v -= P - o.v;
        v = (v < 0) ? v + P : v;
        return *this;
    }
    constexpr Modint& operator-=(Modint o) {
        v -= o.v;
        v = (v < 0) ? v + P : v;
        return *this;
    }
    constexpr Modint& operator*=(Modint o) {
        v = 1LL * v * o.v % P;
        return *this;
    }
    constexpr Modint& operator/=(Modint o) { return *this *= o.inv(); }

    constexpr friend Modint operator++(Modint &a, int) {
        Modint r = a;
        ++a;
        return r;
    }
    constexpr friend Modint operator--(Modint &a, int) {
        Modint r = a;
        --a;
        return r;
    }

    constexpr friend Modint operator+(Modint a, Modint b) {
        return Modint(a) += b;
    }
    constexpr friend Modint operator-(Modint a, Modint b) {
        return Modint(a) -= b;
    }
    constexpr friend Modint operator*(Modint a, Modint b) {
        return Modint(a) *= b;
    }
    constexpr friend Modint operator/(Modint a, Modint b) {
        return Modint(a) /= b;
    }

    constexpr Modint qpow(i64 p) {
        Modint res = 1, x = v;
        while (p > 0) {
            if (p & 1) { res *= x; }
            x *= x;
            p >>= 1;
        }
        return res;
    }
    constexpr Modint inv() {
        return qpow(P - 2);
    }
};

constexpr int P = 998244353;
using Mint = Modint<P>;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    vector<Mint> inv(21);
    for (int i = 1; i <= 20; i++) {
        inv[i] = i == 1 ? 1 : -P / i * inv[P % i];
    }

    int t;
    cin >> t;

    auto solve = [&]() {
        u64 n, N;
        cin >> n >> N;

        unordered_map<u64, Mint> memo;

        auto dp = [&](auto dp, u64 n) -> Mint {
            if (n > N) {
                return 0;
            }

            if (memo.count(n)) {
                return memo[n];
            }

            u64 x = n;
            int zeros = 0, digits = 0;
            Mint sum = 0;

            // dp[n] = 1 + (dp[n] * zeros + sum) / digits

            while (x > 0) {
                int t = x % 10;
                digits++;
                if (t == 0) {
                    zeros++;
                } else {
                    sum += dp(dp, n * (t + 1));
                }
                x /= 10;
            }

            return memo[n] = (digits + sum) * inv[digits - zeros];
        };

        cout << dp(dp, n) << '\n';
    };

    while (t--) {
        solve();
    }
    
    return 0;
}