#include<bits/stdc++.h>
#define rep(i,a,b) for (int i = (a); i <= (b); ++i)
#define drep(i,a,b) for (int i = (a); i >= (b); --i)
#define LL long long
#define pii pair<int,int>
#define pll pair<LL,LL>
#define fi first
#define se second
#define mp make_pair
#define vi vector<int>
#define eb emplace_back
#define all(v) v.begin(),v.end()
#define sz(v) ((int)v.size())
using namespace std;
LL read() {
	LL x = 0,y = 1; char ch = getchar(); while (!isdigit(ch)) {if (ch == '-') y = -y; ch = getchar();}
	while (isdigit(ch)) {x = x*10+ch-'0'; ch = getchar();} return x*y;
}
const int tst = 0,rd = 1; int getflg = 0;
namespace qiqi {
	const int N = 50; const __int128 INF = 0x3f3f3f3f3f3f3f3f3f3f3f3f3f3f3f3f; LL n,m; __int128 pw[N],dp[N][N][2];
	void init() {
		pw[0] = 1; rep(i,1,N-1) pw[i] = 10*pw[i-1];
	}
	void print(__int128 x) {
		vi p; while (x) {p.eb(x%10); x /= 10;}
		reverse(all(p)); for (auto k:p) printf("%d",k);
	}
	void main() {
		n = read(); m = read();
		vi a; while (n) {a.eb(n%10); n /= 10;} a.resize(N);
		rep(i,0,N-1) rep(j,0,m) rep(k,0,1) dp[i][j][k] = INF;
		dp[N-1][0][0] = dp[N-1][0][1] = 0;
		drep(i,N-1,1) rep(j,0,m) {
			if (dp[i][j][0] < INF) {
				dp[i-1][j][0] = min(dp[i-1][j][0],dp[i][j][0]);
				if (a[i-1] != 9) dp[i-1][j][1] = min(dp[i-1][j][1],dp[i][j][0]);
			}
			if (dp[i][j][1] < INF) {
				if (a[i-1]) dp[i-1][j+1][0] = min(dp[i-1][j+1][0],dp[i][j][1]+(10-a[i-1])*pw[i-1]);
				dp[i-1][j+1][1] = min(dp[i-1][j+1][1],dp[i][j][1]+(9-a[i-1])*pw[i-1]);
			}
		}
		__int128 ans = dp[0][m][0];
		if (!ans) {
			rep(i,0,N-1) {
				if (a[i] != 9) {ans += pw[i]; break;}
			}
		}
		print(ans); puts("");
	}
}
int main() {
	qiqi::init(); int T = read(); while (T--) qiqi::main(); return 0;
}