#include <bits/stdc++.h>
#define DEBUG 0
#define CASES 1
#define st first
#define nd second
#define ll long long
using namespace std;
typedef double db;
const int SZ = 2e5 + 7;
const int MX = 1e9 + 7;
const int MOD = 1e9 + 7;
const long long MX2 = 1e18 + 1;

long long dp[20][20][2];

void process(void) {
    string x, y;
    int k;
    cin >> y >> k;
    int you = 18-y.size();
    for(int i=0; i<you; i++) x.push_back('0');
    x += y;

    for(int i=0; i<20; i++) {
        for(int j=0; j<20; j++) {
            if(j>0) dp[i][j][0] = MX2;
            dp[i][j][1] = MX2;
        }
    }

    if(x[x.size()-1] != '0') dp[x.size()-1][1][1] = 10 - (x[x.size()-1] - 48);

    for(int i=x.size()-2; i>-1; i--) {
        for(int j=1; j<=k; j++) {
            long long cnt = 1, idx = 0;
            while(idx < x.size()-1-i) {
                cnt *= 10;
                idx++;
            }
            long long add0 = cnt*(long long)(10-(x[i]-48));
            long long add1 = cnt*(long long)(9-(x[i]-48));
            dp[i][j][1] = dp[i+1][j-1][1] + add1;
            if(x[i] != '0') dp[i][j][1] = min(dp[i][j][1] ,dp[i+1][j-1][0] + add0);
            dp[i][j][0] = dp[i+1][j][0];
            if(x[i] != '9') dp[i][j][0] = min(dp[i][j][0], dp[i+1][j][1]);
        }
    }

    long long res = min(dp[0][k][0], dp[0][k][1]);

    if(!k) {
        int idx = 17, cnt = 0;
        while(idx>-1 && x[idx] == '9') {
            ++cnt;
            --idx;
        }
        cout << '1';
        for(int i=0; i<cnt; i++) cout << '0';
    }
    else cout << (res == MX2 ? -1 : res);
    cout << '\n';

    return ;
}
 
int main() {
    #ifndef DEBUG
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    #endif
    cin.tie(nullptr)->ios::sync_with_stdio(false);
    int t(1);
    if(CASES) cin >> t;
    while(t--) process();
}