#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const ll modc = 998244353;
class mint {
    ll x;
public:
    mint(ll x=0) : x((x%modc+modc)%modc) {}
    mint operator-() const {
      return mint(-x);
    }
    mint& operator+=(const mint& a) {
        if ((x += a.x) >= modc) x -= modc;
        return *this;
    }
    mint& operator-=(const mint& a) {
        if ((x += modc-a.x) >= modc) x -= modc;
        return *this;
    }
    mint& operator*=(const  mint& a) {
        (x *= a.x) %= modc;
        return *this;
    }
    mint operator+(const mint& a) const {
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint& a) const {
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint& a) const {
        mint res(*this);
        return res*=a;
    }
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }
    mint inv() const {
        return pow(modc-2);
    }
    mint& operator/=(const mint& a) {
        return (*this) *= a.inv();
    }
    mint operator/(const mint& a) const {
        mint res(*this);
        return res/=a;
    }
    bool operator == (const mint& a) const{
        return x == a.x;
    }
    friend ostream& operator<<(ostream& os, const mint& m){
        os << m.x;
        return os;
    }
    friend istream& operator>>(istream& ip, mint &m) {
        ll t;
        ip >> t;
        m = mint(t);
        return ip;
    }
    ll val(){
        return x;
    }
};

map<tuple<ll, ll, ll, ll>, mint> mp;
mint f(ll na, ll nb, ll x, ll c){
    if (mp.count({na, nb, x, c})) return mp[{na, nb, x, c}];
    if (na == 0 && nb == 0) return x == 0;

    int a = min(na, 9LL), b = min(nb, 9LL);
    mint res=0;
    for (int i=0; i<=a; i++){
        for (int j=0; j<=b; j++){
            if (i+j+c >= 10) res += f((na-i)/10, (nb-j)/10, x-1, 1);
            else res += f((na-i)/10, (nb-j)/10, x, 0);
        }
    }

    return mp[{na, nb, x, c}] = res;
}

int main(){

    int T, X;
    ll N;
    cin >> T;
    while(T){
        T--;
        mp.clear();
        cin >> N >> X;
        cout << f(N, N, X, 0) << endl;
    }

    return 0;
}