#include <bits/stdc++.h>
#define rep(i, l, r) for(int i = (l); i <= (r); i++)
#define per(i, r, l) for(int i = (r); i >= (l); i--)
#define mem(a, b) memset(a, b, sizeof a)
#define For(i, l, r) for(int i = (l), i##e = (r); i < i##e; i++)
#define pb push_back

using namespace std;
using u32 = uint32_t;
using u64 = uint64_t;
using ll = long long;

struct IO {
    static const int SZ = 1 << 17;
    char inBuf[SZ], *in1, *in2;
    inline __attribute((always_inline))
    u64 read() {
        if(__builtin_expect(in1 > inBuf + SZ - 32, 0)) {
            auto len = in2 - in1;
            memcpy(inBuf, in1, len);
            in1 = inBuf, in2 = inBuf + len;
            in2 += fread(in2, 1, SZ - len, stdin);
            if(in2 != inBuf + SZ) *in2 = 0;
        }
        u64 res = 0;
        char c;
        while((c = *in1++) < 48);
        while(res = res * 10 + c - 48, (c = *in1++) >= 48);
        return res;
    }
    char outBuf[SZ], *out;
    inline __attribute((always_inline))
    void write(u64 x) {
        if(__builtin_expect(out > outBuf + SZ - 32, 0))
            fwrite(outBuf, 1, out - outBuf, stdout), out = outBuf;
        if(!x) return *out++ = 48, void();
        alignas(2) const char* digits =
        "0001020304050607080910111213141516171819"
        "2021222324252627282930313233343536373839"
        "4041424344454647484950515253545556575859"
        "6061626364656667686970717273747576777879"
        "8081828384858687888990919293949596979899";
        alignas(2) static char buf[20];
        char* p = buf + 20;
        while(x >= 10) memcpy(p -= 2, digits + x % 100 * 2, 2), x /= 100;
        if(x) *--p = 48 + x;
        auto len = buf + 20 - p;
        memcpy(out, p, len), out += len;
    }
    IO() {
        in1 = inBuf;
        in2 = in1 + fread(in1, 1, SZ, stdin);
        out = outBuf;
    }
    ~IO() { fwrite(outBuf, 1, out - outBuf, stdout); }
} IO;

const int B = 1e5;

uint8_t sum[B + 8];
u64 ten[12], inv[12];
u64 f[10][11][92][100];

inline u64 pop(u64 x) {
    return sum[x / B] + sum[x % B];
}
inline u64 idiv(u64 x, int i) {
    // return x / ten[i];
    return i ? x * (__uint128_t)inv[i] >> 64 : x;
}
inline u64 mod(u64 x, int i) {
    // return x % ten[i];
    return x * inv[i] * (__uint128_t)ten[i] >> 64;
}
int main() {
    cin.tie(0)->sync_with_stdio(0);
    rep(i, 1, B) sum[i] = sum[i / 10] + i % 10;
    rep(i, 0, 10) ten[i] = i ? ten[i - 1] * 10 : 1, inv[i] = ~0ULL / ten[i] + 1;
    rep(i, 0, 2) rep(j, 1, i == 2 ? 1 : 9) rep(k, 0, 90) For(l, !k, ten[i]) {
        u64 x = l;
        while(x < j * ten[i]) x += k + sum[x];
        f[i][j][k][l] = x - l;
    }
    rep(i, 2, 9) {
        rep(j, 1, 9) rep(k, 0, (9 - i) * 9 + 10 - j) rep(l, !k, 99) {
            auto x = l + f[i][j][k][l];
            f[i][j + 1][k][l] = f[i][j][k][l] + (x < (j + 1) * ten[i] ? f[i][1][k + j][x - j * ten[i]] : 0);
        }
        if(i != 9) memcpy(f[i + 1][1], f[i][10], sizeof f[0][0]);
    }
    u64 q = IO.read(), x, y;
    while(q--) {
        x = IO.read(), y = IO.read() + 1;
        int i = 2;
        while(1) {
            auto hi = idiv(x, i), k = 10 - hi % 10;
            if(hi + k > idiv(y, i)) break;
            x += f[i][k][pop(hi)][mod(x, i)], i++;
        }
        while(x < y) {
            auto hi = idiv(x, i);
            x += f[i][(idiv(y, i) - hi) % 10][pop(hi)][mod(x, i)], i--;
        }
        cout << x << '\n';
    }
}