#include <stdio.h>

const int Mod = 998244353;
unsigned long long pow[20];

long long solve(long long N, int X)
{
	int i, j, k, x, y, d, dj, dk;
	long long ans = 0, dp[20][2][2][20][2][2] = {}, tmp;
	for (i = 0, dp[0][0][0][0][0][1] = 1; pow[i] <= N; i++) {
		d = N / pow[i] % 10;
		for (j = 0; j < 2; j++) {
			for (k = 0; k < 2; k++) {
				for (x = 0; x <= X; x++) {
					for (y = 0; y < 2; y++) {
						if (x == X) ans += dp[i][j][k][x][y][1] % Mod;
						tmp = (dp[i][j][k][x][y][0] + dp[i][j][k][x][y][1]) % Mod;
						if (tmp == 0) continue;
						for (dj = 0; dj < 10; dj++) {
							for (dk = 0; dk < 10; dk++) {
								if (dj < d) {
									if (dk < d) {
										if (dj == 0 && dk == 0) dp[i+1][0][0][x][0][0] += tmp;
										else if (dj + dk + y >= 10) dp[i+1][0][0][x+1][1][1] += tmp;
										else dp[i+1][0][0][x][0][1] += tmp;
									} else if (dk == d) {
										if (dj + dk + y >= 10) dp[i+1][0][k][x+1][1][1] += tmp;
										else dp[i+1][0][k][x][0][1] += tmp;
									} else {
										if (dj + dk + y >= 10) dp[i+1][0][1][x+1][1][1] += tmp;
										else dp[i+1][0][1][x][0][1] += tmp;
									}
								} else if (dj == d) {
									if (dk < d) {
										if (dj + dk + y >= 10) dp[i+1][j][0][x+1][1][1] += tmp;
										else dp[i+1][j][0][x][0][1] += tmp;
									} else if (dk == d) {
										if (dj == 0 && dk == 0) dp[i+1][j][k][x][0][0] += tmp;
										else if (dj + dk + y >= 10) dp[i+1][j][k][x+1][1][1] += tmp;
										else dp[i+1][j][k][x][0][1] += tmp;
									} else {
										if (dj + dk + y >= 10) dp[i+1][j][1][x+1][1][1] += tmp;
										else dp[i+1][j][1][x][0][1] += tmp;
									}
								} else {
									if (dk < d) {
										if (dj + dk + y >= 10) dp[i+1][1][0][x+1][1][1] += tmp;
										else dp[i+1][1][0][x][0][1] += tmp;
									} else if (dk == d) {
										if (dj + dk + y >= 10) dp[i+1][1][k][x+1][1][1] += tmp;
										else dp[i+1][1][k][x][0][1] += tmp;
									} else {
										if (dj + dk + y >= 10) dp[i+1][1][1][x+1][1][1] += tmp;
										else dp[i+1][1][1][x][0][1] += tmp;
									}
								}
							}
						}
					}
				}
			}
		}
	}
	ans += (dp[i][0][0][X][0][1] + dp[i][0][0][X][1][1]) % Mod;
	return ans % Mod;
}

int main()
{
	int T, X;
	long long N;
	scanf("%d", &T);
	for (X = 1, pow[0] = 1; X <= 19; X++) pow[X] = pow[X-1] * 10;
	while (T--) {
		scanf("%lld %d", &N, &X);
		printf("%lld\n", solve(N, X));
	}
	fflush(stdout);
	return 0;
}