#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef __int128 lll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<ll, ll> pii;

inline void write(lll x) {
	if (x > 9) {
		write(x / 10);
	}
	putchar('0' + x % 10);
}

ll n, m, f[20][20][2], a[20], tot;

void solve() {
	scanf("%lld%lld", &n, &m);
	if (m == 0) {
		ll ans = 1;
		while (n % 10 == 9) {
			n /= 10;
			ans *= 10;
		}
		printf("%lld\n", ans);
		return;
	}
	ll pw = 1;
	while (n % 10 == 0) {
		n /= 10;
		pw *= 10;
	}
	tot = 0;
	ll x = n;
	while (x) {
		a[++tot] = x % 10;
		x /= 10;
	}
	mems(f, 0x3f);
	f[0][0][0] = 0;
	ll p = 1;
	for (int i = 1; i <= 18; ++i, p *= 10) {
		for (int j = 0; j < 18; ++j) {
			for (int k = 0; k < 2; ++k) {
				for (int t = 0; t <= 9; ++t) {
					int nj = (t + a[i] + k) / 10 + j, nk = (t + a[i] + k) / 10;
					f[i][nj][nk] = min(f[i][nj][nk], f[i - 1][j][k] + p * t);
				}
			}
		}
	}
	write((lll)min(f[18][m][0], f[18][m][1]) * pw);
	putchar('\n');
}

int main() {
	int T = 1;
	scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}