#include<bits/stdc++.h>

using namespace std;

using i64 = long long ;
using i128 = __int128;

const int N = 1e5 + 10;

i64 n, k;
i128 pw[40];
string s;

i128 calc()
{
    i128 res = 0;
    for(i128 i = 0;i < s.size();i ++)
        res = res * 10 + (s[i] - '0');
    return res;
}

// i128 read()
// {
//     i128 x = 0, f = 1;
//     char ch = getchar();
//     while (ch < '0' || ch > '9')
//     {
//         if (ch == '-') f = -1;
//         ch = getchar();
//     }
    
//     while(ch >= '0' && ch <= '9')
//     {
//         x = x * 10 + (ch - '0');
//         ch = getchar();
//     }
//     return x * f;
// }

void print(i128 x)
{
    if (x  < 0)
    {
        putchar('-');
        x = -x;
    }
    if (x > 9)
        print(x / 10);
    putchar('0' +( x % 10));
}

void solve()
{
    cin >> s >> k;

    n = calc();

    if (k == 0) 
    {
        puts("1");
        return ;
    }

    reverse(s.begin(), s.end());
    for(i128 i = 0;i < s.size();i ++)
    {
        i64 st = i + k;
        i128 aim = n % pw[st] / pw[i];
        if (s[st - 1] == '9' && st != s.size() || aim == 0 || s[i] == '0') continue;
        i128 ans = pw[st] - aim * pw[i];
        print(ans);
        puts("");
        return ;
    }

    puts("-1");
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    pw[0] = 1;
    for(i128 i = 1;i < 40;i ++)
        pw[i] = pw[i - 1] * 10;

    int T = 1;
    cin >> T;
    while(T --)
        solve();

    return 0;
}