#include <bits/stdc++.h>
using namespace std;

using ll = long long;
const int B = 1e5, M = 100;
int sigma[B], f[10][M][M];
ll pw[11];

int get(ll x) {
	return sigma[x / B] + sigma[x % B];
}

void init() {
	for (int i = 1; i < B; i++) {
		sigma[i] = sigma[i / 10] + i % 10;
	}
	for (int i = pw[0] = 1; i <= 10; i++) {
		pw[i] = 10 * pw[i - 1];
	}
	for (int i = 0; i < 10; i++) {
		for (int j = 0; j < M; j++) {
			for (int k = M - 1; ~k; k--) {
				if (!i) {
					int t = j + k + get(k);
					f[i][j][k] = t >= M ? t - M : f[i][j][t];
				} else {
					f[i][j][k] = k;
					for (int _ = 0; _ < 10 && j + _ < M; _++) {
						f[i][j][k] = f[i - 1][j + _][f[i][j][k]];
					}
				}
			}
		}
	}
}

void solve() {
	ll x, y;
	cin >> x >> y, y++;
	ll a = x / M, c = x % M;
	ll b = y / M, d = y % M;
	int o = 0;
	if (!a && b) {
		a = 1, c = f[0][0][c];
	}
	while (a < b) {
		while (a % pw[o + 1] == 0) o++;
		if (a + pw[o] > b) break;
		c = f[o][get(a)][c];
		a += pw[o];
	}
	while (1) {
		while (~o && a + pw[o] > b) o--;
		if (!~o) break;
		c = f[o][get(a)][c];
		a += pw[o];
	}
	while (c < d) {
		c += get(a * M + c);
	}
	cout << a * M + c << "\n";
}

int main() {
	ios::sync_with_stdio(0), cin.tie(0);
	int q;
	cin >> q;
	init();
	while (q--) {
		solve();
	}
	return 0;
}