#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/modint>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using mint = atcoder::modint998244353;

ostream& operator<<(ostream& os, const mint& m){
    os << m.val();
    return os;
}

using T = tuple<ll, ll, int, int>;

mint sub_solve(ll a, ll b, int x, int carry){
    static map<T, mint> memo;
    if(a > b) swap(a, b);
    T key(a, b, x, carry);
    if(b == 0) {
        if(x == 0) return mint(1);
        return mint(0);
    }
    if(memo.count(key)) return memo[key];
    mint ans = 0;
    if(b < 10){
        if(x >= 2){
            return mint(0);
        }
        for(int i = 0; i <= a; i++){
            for(int j = 0; j <= b; j++){
                if(i+j+carry >= 10) {
                    if(x == 1) ans++;
                }else{
                    if(x == 0) ans++;
                }
            }
        }
        memo[key] = ans;
        return ans;
    }
    for(int aa = 0; aa <= 9 && aa <= a; aa++){
        for(int bb = 0; bb <= 9 && bb <= b; bb++){
            ll a_rem = (a-aa)/10;
            ll b_rem = (b-bb)/10;
            int next_carry = aa+bb+carry >= 10 ? 1 : 0;
            int x_rem = x-next_carry;
            if(x_rem < 0) continue;
            ans += sub_solve(a_rem, b_rem, x_rem, next_carry);
        }
    }
    memo[key] = ans;
    return ans;
}

mint solve(ll n, int x){
    return sub_solve(n, n, x, 0);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int t; cin >> t;
    while(t--) {
        ll n; cin >> n;
        int x; cin >> x;
        cout << solve(n, x) << endl;
    }
}