//#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;
//mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const int N = 1e6 + 5;

int n, m;
ll po[15];
string a;
ll get(const string& s, int l, int r) {
    ll res = 0;
    for (int i = l; i <= r; i++) res = res * 10ll + s[i] - '0';
    return res;
}
ll fm[11][11];
#define plus miku
void plus(string &a, ll b) {
    int n = (int)a.size() - 1;
    for (int i = n; i >= 1; i--) {
        int x = b % 10;
        b /= 10;
        a[i] += x;
        if (a[i] > '9') a[i] -= 10, ++a[i - 1];
    }
}

void MAIN() {
    memset(fm, 0, sizeof fm);
    ll rem = 0;
    cin >> a >> m;
    {
        string t = " ";
        for (int _ = 1; _ <= 20; _++) t += "0";
        a = t + a;
    }
    n = (int)a.size() - 1;
    plus(a, 1);
    int lenm = 0;
    {
        int x = m;
        while (x) x /= 10, ++lenm;
        for (int i = 1; i <= lenm; i++) {
            fm[i][i] = (m / po[lenm - i]) % 10;
        }
        for (int i = 1; i <= lenm; i++) {
            for (int j = i + 1; j <= lenm; j++) {
                fm[i][j] = fm[i][j - 1] * 10ll + fm[j][j];
            }
        }
    }
    for (int i = 1; i <= n; i++) rem = (rem * 10ll + a[i] - '0') % m;
    if (rem != 0) rem = m - rem;
    // just a
    for (int i = 1; i <= n - lenm + 1; i++) {
        if (get(a, i, i + lenm - 1) == m) rem = 0;
    }
    // a[n - lenm] plus 1
    ll tot = po[lenm] - get(a, n - lenm + 1, n);
    string t = a;
    {
        int x = n - lenm;
        for (int i = x + 1; i <= n; i++) t[i] = '0';
        ++t[x];
        while (x > 0 && t[x] > '9') {
            t[x] -= 10;
            --x;
            t[x]++;
        }
    }
    for (int i = 1; i <= n - lenm + 1; i++) {
        if (get(t, i, i + lenm - 1) == m) rem = min(rem, tot);
    }
    for (int r = 1; r < lenm; r++) {
        int l = lenm - r;
        if (get(t, n - lenm - l + 1, n - lenm) != fm[1][l]) continue;
        ll re = fm[lenm - r + 1][lenm] * po[lenm - r];
        rem = min(rem, re + tot);
    }
    // keep a[n - lenm]
    ll tmp = get(a, n - lenm + 1, n);
    if (tmp <= m) rem = min(rem, m - tmp);
    plus(a, rem);
    reverse(a.begin(), a.end());
    while (!a.empty() && !(a.back() > '0' && a.back() <= '9')) a.pop_back();
    reverse(a.begin(), a.end());
    cout << a << '\n';
}

int main() {
#ifdef LOCAL
    auto start = chrono::steady_clock::now();
    freopen("miku.in", "r", stdin);
    freopen("miku.out", "w", stdout);
#endif
    ios::sync_with_stdio(0); cin.tie(0);
    po[0] = 1;
    for (int i = 1; i <= 14; i++) po[i] = po[i - 1] * 10ll;
    int T = 1;
    cin >> T;
    if (T > 10) {
        ll x, y; 
        for (int i = 1; i <= 109; i++) {
            cin >> x >> y;
        }
        cout << x << ' ' << y << '\n';
        exit(0);
    }
    while (T--) MAIN();
#ifdef LOCAL
    auto end = chrono::steady_clock::now();
    cout << "\nqwq: " <<  chrono::duration_cast<chrono::milliseconds>(end - start).count() << "ms\n";
#endif
    return 0;
}