#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
map<vector<long long>, mint>mp;
mint dp(long long n, long long m, int x, int f) {
	//cout << n << " " << m << " " << x << " " << f << endl;
	if (mp.count({ n,m,x,f }))return mp[{n, m, x, f}];
	if (0 == n + m) {
		if (0 == x)return 1;
		else return 0;
	}
	mint ret = 0;
	rep(i, 10)rep(j, 10) {
		if (n < i)continue;
		if (m < j)continue;
		int nf = 0;
		int nx = x;
		if (f + i + j >= 10) {
			nf = 1;
			nx--;
		}
		long long nn = n / 10;
		if (n % 10 < i)nn--;
		long long nm = m / 10;
		if (m % 10 < j)nm--;
		ret += dp(nn, nm, nx, nf);
	}
	return mp[{n, m, x, f}] = ret;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		mp.clear();
		long long n, x; cin >> n >> x;
		mint ans = dp(n, n, x, 0);
		cout << ans.val() << endl;
	}
	return 0;
}