#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while(tt--) {
    ll n;
    int x;
    cin >> n >> x;
    mint dp[20][2][2][2];
    dp[0][0][0][0] = 1;
    rep(_, 19) {
      int r = n % 10;
      n /= 10;
      mint ndp[20][2][2][2];
      rep(i, 20) rep(j, 2) rep(k, 2) rep(l, 2) if (mint v = dp[i][j][k][l]; v.val()) {
        rep(s, 10) rep(t, 10) {
          int u = s + t + l;
          int nl = u >= 10;
          int ni = i + nl;
          int nj = s > r || r == s && j;
          int nk = t > r || r == t && k;
          ndp[ni][nj][nk][nl] += v;
        }
      }
      swap(dp, ndp);
    }
    mint ans = dp[x][0][0][0];
    cout << ans.val() << '\n';
  }
}