#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (ll i=a;i<b;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}



void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	cin>>t;
	rep(i,0,t) solve();
}

void solve(){
	ll N,X;
	cin>>N>>X;
	int D=20;
	vector<int> p(D);
	rep(i,0,D) p[i]=N%10,N/=10;
	vector dp(2,vector(2,vector(2,vector<ll>(D+1))));//{upper?,kuriagari?,kuriagari_count}
	dp[0][0][0][0]=1;
	auto f=[&](int bef,int ind,int val)->int{
		if(p[ind]<val) return 1;
		if(p[ind]>val) return 0;
		return bef;
	};
	rep(d,0,D){
		vector n_dp(2,vector(2,vector(2,vector<ll>(D+1))));
		rep(up_a,0,2) rep(up_b,0,2) rep(i,0,10) rep(j,0,10) rep(k,0,2) rep(l,0,d+1){
			int n_a=f(up_a,d,i);
			int n_b=f(up_b,d,j);
			int n_k=0;
			int n_c=l;
			if(i+j+k>=10) n_k=1,n_c++;
			n_dp[n_a][n_b][n_k][n_c]+=dp[up_a][up_b][k][l];
			n_dp[n_a][n_b][n_k][n_c]%=mod;
		}
		//rep(i,0,2) rep(j,0,2) cout<<dp[i][j][0][0]<<" ";
		//cout<<endl;
		swap(n_dp,dp);
	}
	//rep(i,0,2) rep(j,0,2) cout<<dp[i][j][0][X]<<" ";
	cout<<dp[0][0][0][X]<<"\n";
}