#include<bits/stdc++.h> #include<atcoder/all> using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; typedef vector<ll> vi; typedef vector<vi> vvi; typedef vector<vvi> vvvi; typedef vector<vvvi> vvvvi; typedef pair<ll,ll> pi; typedef pair<ll,pi> ppi; typedef pair<ll,ppi> pppi; typedef pair<ll,pppi> ppppi; #define FOR(i,l,r) for(ll i=l;i<r;i++) #define REP(i,n) FOR(i,0,n) #define RFOR(i,l,r) for(ll i=r-1;i>=l;i--) #define RREP(i,n) RFOR(i,0,n) #define ALL(x) x.begin(),x.end() #define F first #define S second #define BS(A,x) binary_search(ALL(A),x) #define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin()) #define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin()) #define COU(A,x) (UB(A,x)-LB(A,x)) #define sz(c) ((ll)(c).size()) /* #include<boost/multiprecision/cpp_int.hpp> namespace mp=boost::multiprecision; using Bint=mp::cpp_int; */ template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>; template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<" "<<p.S;return os;} template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;} template<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;} template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;} template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;} template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;} ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));} //* using mint=modint998244353; const ll mod=998244353; //*/ /* using mint=modint1000000007; const ll mod=1000000007; //*/ //using mint=modint; //* typedef vector<mint> vm; typedef vector<vm> vvm; typedef vector<vvm> vvvm; typedef vector<vvvm> vvvvm; ostream&operator<<(ostream&os,mint&a){os<<a.val();return os;} //*/ int main(){ ll T;cin>>T; while(T--){ ll N,X;cin>>N>>X; bool t=0; if(N==1e18){ t=1; N--; } vvvvm DP(18,vvvm(4,vvm(2,vm(20)))); string S=to_string(N); while(sz(S)<18)S="0"+S; reverse(ALL(S)); REP(a,10)REP(b,10)DP[0][3-(a<=S[0]-'0')-2*(b<=S[0]-'0')][(a+b)>9][(a+b)>9]++; FOR(i,1,18){ REP(a,10)REP(b,10)REP(s,4)REP(t,2)REP(x,19){ ll p=0; if(a>S[i]-'0'||(a==S[i]-'0'&&s%2))p++; if(b>S[i]-'0'||(b==S[i]-'0'&&s/2))p+=2; ll q=a+b+t>9; DP[i][p][q][q+x]+=DP[i-1][s][t][x]; } } mint ans=DP[17][0][0][X]+DP[17][0][1][X]; if(t&&X==0){ N++; ans+=2*N%mod*(N-1)%mod+1; } cout<<ans<<endl; } return 0; }