#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=998244353;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

struct Hash_table {
	static const int V=1000003;
	int fst[V],nxt[V];
	int ctm,ptm[V],T;
	int val[V];
	ll key[V];
	void init() { T=0; ctm++;}
	void insert(ll s,int v) {
		int S=s%V;
		if (ptm[S]!=ctm) ptm[S]=ctm,fst[S]=-1;
		for (int j=fst[S];j!=-1;j=nxt[j]) if (key[j]==s) {
			val[j]=v;
			return;
		}
		nxt[T]=fst[S],fst[S]=T,key[T]=s,val[T]=v;
		T++;
	}
	int query(ll s) {
		int S=s%V;
		if (ptm[S]!=ctm) return -1;
		for (int j=fst[S];j!=-1;j=nxt[j]) if (key[j]==s) 
			return val[j];
		return -1;
	}
}dp;

typedef unsigned long long u64;
u64 n,N,inv[33];

int calc(u64 x) {
	if (x>N) return 0;
	int v=dp.query(x);
	if (v!=-1) return v;
	vector<int> dd;
	u64 xx=x;
	while (xx) {
		dd.pb(xx%10);
		xx/=10;
	}
	int m=SZ(dd);
	ll val=0;
	int zp=0;
	rep(i,0,m) if (dd[i]>0) {
		val=(val+calc(x*(dd[i]+1)));
	} else {
		zp++;
	}
	val%=mod;
	val=(val*inv[m-zp]+m*inv[m-zp])%mod;
	dp.insert(x,val);
	return val;
}

void solve() {
	scanf("%llu%llu",&n,&N);
	dp.init();
	printf("%d\n",calc(n));
}

int _;
int main() {
	rep(i,1,20) inv[i]=powmod(i,mod-2);
	for (scanf("%d",&_);_;_--) {
		solve();
	}
}