#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)

template <class T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <class T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

struct io_setup {
	io_setup() {
		ios::sync_with_stdio(false);
		cin.tie(nullptr);
		cout << fixed << setprecision(15);
	}
} io_setup;

using mint = atcoder::modint998244353;

void solve() {
	ll n, k;
	cin >> n >> k;
	ll pw = 1;
	rep(i, 0, k) pw *= 10;
	ll un = n / pw, dn = n % pw;
	auto choice3 = [&](ll x) {
		mint res = 0;
		res += mint(x - x / 2 - 1) * (x / 2);
		return res;
	};
	auto choicemaxed = [&](ll x, ll mx) {
		mint res = 0;
		mint cj = (x - mx + 1) / 2;
		res += (cj - 1) * mx;
		res += ((x / 2) - cj + 1) * (x - x / 2 - cj);
		return res;
	};
	mint ans = 0;
	ans += choice3(pw) * choice3(un);
	ans += choicemaxed(pw, dn) * choicemaxed(un + 1, 1);
	cout << ans.val() << '\n';
}

int main() {
	int t = 1;
	cin >> t;
	while (t--) solve();
}