#include <bits/stdc++.h>
#define int __int128
#define fi first
#define se second
#define pb push_back
#define mk make_pair
#define space putchar(' ')
#define enter putchar('\n')
using namespace std;

const int INF=1e36;

inline int read() {
	int x = 0, f = 1;
	char c = getchar();
	while (c < '0' || c > '9') f = c == '-' ? -1 : f, c = getchar();
	while (c >= '0' && c <= '9') x = (x<<3)+(x<<1)+(c^48), c = getchar();
	return x*f;
}

inline void write(int x) {
	if (x < 0) x = -x, putchar('-');
	if (x > 9) write(x/10);
	putchar('0'+x%10);
}

const int N = 20;
int lim = 19, a[N], w[N], f[N][N][2];

inline void upd(int &x, int y) { x = y < x ? y : x; }

inline void solve() {
	int x = read(), k = read(), cnt = 0;
	if (!k) {
		while (x%10 == 9) ++cnt, x /= 10;
		return (void)(write(w[cnt+1]), enter);
	}
	for (int i = 1; i <= lim; ++i) a[i] = x%10, x /= 10;
	for(int i=0;i<=lim;++i) for(int j=0;j<=k;++j) f[i][j][0]=f[i][j][1]=INF; f[0][0][0] = 0;
	for (int i = 1; i <= lim; ++i)
		for (int j = 0; j <= k; ++j) {
			upd(f[i][j][0], f[i-1][j][0]);
			if (a[i] < 9) upd(f[i][j][0], f[i-1][j][1]);
			if (!j) continue;
			upd(f[i][j][1], f[i-1][j-1][1]+w[i]*(10-a[i]-1));
			if (a[i]) upd(f[i][j][1], f[i-1][j-1][0]+w[i]*(10-a[i]));
		}
	write(f[lim][k][0]),putchar('\n');
}

signed main() {
	w[1] = 1;
	for (int i = 2; i <= lim; ++i) w[i] = w[i-1]*10;
	int t = read();
	while (t--) solve();
	return 0;
}