#include <bits/stdc++.h>
using namespace std;
const int D = 19;
const int B = 10;
const long long MOD = 998244353;
int main(){
  int T;
  cin >> T;
  for (int i = 0; i < T; i++){
    long long N;
    int X;
    cin >> N >> X;
    vector<vector<vector<vector<long long>>>> dp(D + 1, vector<vector<vector<long long>>>(4, vector<vector<long long>>(2, vector<long long>(X + 1, 0))));
    dp[0][0][0][0] = 1;
    for (int j = 0; j < D; j++){
      for (int k = 0; k < 4; k++){
        for (int l = 0; l < 2; l++){
          for (int m = 0; m <= X; m++){
            for (int a = 0; a < B; a++){
              for (int b = 0; b < B; b++){
                int k2 = k;
                if (a < N % B){
                  k2 &= ~1;
                } else if (a > N % B){
                  k2 |= 1;
                }
                if (b < N % B){
                  k2 &= ~2;
                } else if (b > N % B){
                  k2 |= 2;
                }
                int l2 = (a + b + l) >= B;
                int m2 = m + l2;
                if (m2 <= X){
                  dp[j + 1][k2][l2][m2] += dp[j][k][l][m];
                  dp[j + 1][k2][l2][m2] %= MOD;
                }
              }
            }
          }
        }
      }
      N /= B;
    }
    cout << dp[D][0][0][X] << endl;
  }
}