#include <cstdio>
#include <cstring>
#include <cctype>
#include <algorithm>
#include <iostream>
#include <queue>
typedef long long LL;
using namespace std;
inline LL read() {
    LL num = 0 ,f = 1; char c = getchar();
    while (!isdigit(c)) f = c == '-' ? -1 : f ,c = getchar();
    while (isdigit(c)) num = (num << 1) + (num << 3) + (c ^ 48) ,c = getchar();
    return num * f;
}
const int N = 20 ,INF = 0x3f3f3f3f;
int f[N][N][2] ,k ,pre[N][N][2];
LL x;
inline void fuling_solve() {
    memset(f ,0x3f ,sizeof(f));
    memset(pre ,0 ,sizeof(pre));
    x = read() ,k = read();
    vector <int> nums(1);
    while (x) nums.emplace_back(x % 10) ,x /= 10;
    if (k == 0) {
    	string res;
    	for (int i = 1; i < (int)nums.size(); i++) if (nums[i] == 9) res += '0'; else {
    		res += '1'; break;
		}
		if (res.back() != '1') res += '1';
		reverse(res.begin() ,res.end());
		cout << res << endl;
		return ;
	}
    while ((int)nums.size() < k + 1) nums.emplace_back(0);
    f[0][0][0] = 1;
    for (int i = 0; i < (int)nums.size(); i++)
        for (int j = 0; j <= k; j++)
            for (int p = 0; p <= 1; p++)
                if (f[i][j][p] != INF) {
                    for (int now = 0; now <= 9; now++) {
                        int q = now + nums[i + 1] + p >= 10;
                        if (f[i + 1][j + q][q] > now) {
                        	f[i + 1][j + q][q] = now;
							pre[i + 1][j + q][q] = p;
						}
                    }
                }
    int st = f[(int)nums.size() - 1][k][0] < f[(int)nums.size() - 1][k][1] ? 0 : 1;
    string str;
    for (int i = (int)nums.size() - 1; i >= 1; i--) {
        int q = f[i][k][st];
        str += q + '0';
		int tmp = k;
		k -= st;
        st = pre[i][tmp][st];
    }
    reverse(str.begin() ,str.end());
    while (str.size() && str.back() == '0') str.pop_back();
    if (str.size() == 0u) str += '1';
    reverse(str.begin() ,str.end());
	cout << str << endl;
}
signed main() {
    int t = read();
    while (t--) fuling_solve();
    return 0;
}