#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define codefor int test;cin>>test;while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
using namespace std;
using ll = long long;
template<class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
template<class T> istream& operator>>(istream& is, vector<T>& vec) {for(T& x : vec)is >> x;return is;}
template<class T> ostream& operator<<(ostream& os, const vector<T>& vec) {if(vec.empty())return os;os << vec[0];for(auto it = vec.begin(); ++it!= vec.end();)os << ' ' << *it;return os;}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){cin >> head;in(tail...);}
void out(){cout << '\n';}
template<class T>void out(const T& a){cout << a << '\n';}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){cout << head << ' ';out(tail...);}
const int INF = 1 << 30;
const long long INF2 = 1ll << 60;
template<class T> void chmax(T &a,const T b){if(b>a)a=b;}
template<class T> void chmin(T &a,const T b){if(b<a)a=b;}

template<const unsigned int MOD> struct prime_modint {
    using mint = prime_modint;
    unsigned int v;
    prime_modint() : v(0) {}
    prime_modint(unsigned int a) { a %= MOD; v = a; }
    prime_modint(unsigned long long a) { a %= MOD; v = a; }
    prime_modint(int a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; }
    prime_modint(long long a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; }
    static constexpr int mod() { return MOD; }
    mint& operator++() {v++; if(v == MOD)v = 0; return *this;}
    mint& operator--() {if(v == 0)v = MOD; v--; return *this;}
    mint operator++(int) { mint result = *this; ++*this; return result; }
    mint operator--(int) { mint result = *this; --*this; return result; }
    mint& operator+=(const mint& rhs) { v += rhs.v; if(v >= MOD) v -= MOD; return *this; }
    mint& operator-=(const mint& rhs) { if(v < rhs.v) v += MOD; v -= rhs.v; return *this; }
    mint& operator*=(const mint& rhs) {
        v = (unsigned int)((unsigned long long)(v) * rhs.v % MOD);
        return *this;
    }
    mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }
    mint operator+() const { return *this; }
    mint operator-() const { return mint() - *this; }
    mint pow(long long n) const {
        assert(0 <= n);
        mint r = 1, x = *this;
        while (n) {
            if (n & 1) r *= x;
            x *= x;
            n >>= 1;
        }
        return r;
    }
    mint inv() const { assert(v); return pow(MOD - 2); }
    friend mint operator+(const mint& lhs, const mint& rhs) { return mint(lhs) += rhs; }
    friend mint operator-(const mint& lhs, const mint& rhs) { return mint(lhs) -= rhs; }
    friend mint operator*(const mint& lhs, const mint& rhs) { return mint(lhs) *= rhs; }
    friend mint operator/(const mint& lhs, const mint& rhs) { return mint(lhs) /= rhs; }
    friend bool operator==(const mint& lhs, const mint& rhs) { return (lhs.v == rhs.v); }
    friend bool operator!=(const mint& lhs, const mint& rhs) { return (lhs.v != rhs.v); }
    friend std::ostream& operator << (std::ostream &os, const mint& rhs) noexcept { return os << rhs.v; }
};
//using mint = prime_modint<1000000007>;
using mint = prime_modint<998244353>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    codefor{
        LL(n, x);
        string s = to_string(n);
        //桁数,フラグ,桁上がり回数,次で桁上がり必須か
        mint dp[s.size() + 1][8][s.size() + 1];
        dp[0][3][0] = 1;
        dp[0][7][0] = 1;
        auto f2 = [&](int l1, int r1, int l2, int r2, int S){
            int res = 0;
            res += ((l1 == r1) & (S & 1));
            res += 2 * ((l2 == r2) & (S >> 1 & 1));
            return res;
        };
        for(int i = 0; i < s.size(); i++){
            for(int j = 0; j < 8; j++){
                int r1 = j & 1 ? s[i] - '0' : 9;
                int r2 = j >> 1 & 1 ? s[i] - '0' : 9;
                int f = j >> 2 & 1; //桁上がりするかしないか
                for(int k = 0; k < s.size(); k++){
                    for(int l1 = 0; l1 <= r1; l1++){
                        for(int l2 = 0; l2 <= r2; l2++){
                            if(l1 + l2 < 9){
                                if(f) continue;
                                dp[i + 1][f2(l1, r1, l2, r2, j)][k] += dp[i][j][k];
                                dp[i + 1][f2(l1, r1, l2, r2, j) + 4][k] += dp[i][j][k];
                            }else if(l1 + l2 == 9){
                                if(f){
                                    dp[i + 1][f2(l1, r1, l2, r2, j) + 4][k + 1] += dp[i][j][k];
                                }else{
                                    dp[i + 1][f2(l1, r1, l2, r2, j)][k] += dp[i][j][k];
                                }
                            }else{
                                if(!f) continue;
                                dp[i + 1][f2(l1, r1, l2, r2, j)][k + 1] += dp[i][j][k];
                                dp[i + 1][f2(l1, r1, l2, r2, j) + 4][k + 1] += dp[i][j][k];
                            }
                        }
                    }
                }
            }
        }
        mint ans;
        for(int i = 0; i < 4; i++){
            if(x <= s.size()) ans += dp[s.size()][i][x];
        }
        out(ans);
    }
}