#include <bits/stdc++.h>
#define int long long
using namespace std;
int T, n, k, f[25][25][2], vis[25][25][2];
void solve() {
	for(int i = 0;i <= 20;i++) for(int j = 0;j <= 20;j++) for(int op = 0;op <= 1;op ++) f[i][j][op] = 5e18;
	scanf("%lld%lld", &n, &k);
	int now = 1;
	for(int i = 1;i <= 18;i++) {
		int g = n / now % 10;
		if(g)f[i][1][1] = min(f[i][1][1], now * (10 - g));
		if(g - 9) f[i][0][0] = min(f[i][0][0], now);  
		for(int j = 0;j <= k;j++) {
//			if(i == 6 && j == 0) cout << g << " " << f[i - 1][j][0] << " " << f[i - 1][j][1] << " " << f[6][1][1] << endl;
			if(g) f[i][j + 1][1] = min(f[i][j + 1][1], f[i - 1][j][0] + now * (10 - g));
			
			f[i][j][0] = min(f[i][j][0], f[i - 1][j][0]);	
			
			f[i][j + 1][1] = min(f[i][j + 1][1], f[i - 1][j][1] + now * (10 - 1 - g));
			if(g != 9) f[i][j][0] = min(f[i][j][0], f[i - 1][j][1]);
			
//			cout << i << " " << j << " " << f[i][j][0] << " " << f[i][j][1] << endl;
		}
		now *= 10;
	}
//	cout << f[6][1][1] << endl;
	printf("%lld\n", min(f[18][k][1], f[18][k][0]));
}
signed main() {
	scanf("%lld", &T);
	while(T --) solve();
}