#include <bits/stdc++.h>

#define int long long
#define all(a) (a).begin(), (a).end()
#define sz(a) (int) (a).size()
#define forn(i, n) for(int i = 0; i < (n); i++)

using namespace std;

int carryLam(__int128_t a, __int128_t b){
    __int128_t c = 0, res = 0;
    while(a > 0 || b > 0){
        int a0 = a % 10, b0 = b % 10; a /= 10; b /= 10;
        if (a0 + b0 + c >= 10) c = 1, res++;
        else c = 0;
    }
    return res;
}

int x, k; 
__int128_t ans = -1;
void test(__int128_t y){
    int c = carryLam(x, y);
    if(c == k){
        ans = ans == -1 || y < ans ? y : ans;
    }
}

void solve(){
    ans = -1;
    cin >> x >> k;
    test(1);
    __int128_t r = 0, pw10[37];
    pw10[0] = 1; for(int i = 1; i <= 36; i++) pw10[i] = pw10[i - 1] * 10;
    for(int l = 0; l < 18; l++){
        for(int b = l + 1; b <= 36; b++){
            test(pw10[b] - (x % pw10[b]) / pw10[l] * pw10[l]);
        }
    }
    if(ans == -1){
        cout << -1 << '\n';
    }else{
        string r; while(ans > 0) r.push_back('0' + ans % 10), ans /= 10; reverse(all(r));
        cout << r << '\n';
    }
}

int32_t main(){
    cin.tie(0); cout.tie(0)->sync_with_stdio(false);
    int t = 1;
    cin >> t;
    while(t--){
        solve();
    }
}