#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
#define rep(i, a, b) for(int i = (a); i <= (b); i ++)
#define per(i, a, b) for(int i = (a); i >= (b); i --)
#define Ede(i, u) for(int i = head[u]; i; i = e[i].nxt)
using namespace std;

inline ll read() {
	ll x = 0, f = 1; char c = getchar();
	while(c < '0' || c > '9') f = (c == '-') ? - 1 : 1, c = getchar();
	while(c >= '0' && c <= '9') x = x * 10 + c - 48, c = getchar();
	return x * f;
}

const int blo = 100000;
int s[blo + 10], f[15][110][110]; ll p[15];

int calc(ll x) {return s[x / blo] + s[x % blo];}

void solve(ll x, ll y) {
	y ++;
	ll a = x / 100, b = x % 100;
	ll c = y / 100, d = y % 100; int o = 0;
	if(!a && c) a = 1, b = f[0][0][b];
	while(a < c) {
		while(a % p[o + 1] == 0) o ++;
		if(a + p[o] > c) break;
		b = f[o][calc(a)][b], a += p[o];
	}
	while(true) {
		while(o >= 0 && a + p[o] > c) o --;
		if(o == -1) break;
		b = f[o][calc(a)][b], a += p[o];
	}
	while(b < d) b += calc(a * 100 + b);
	printf("%lld\n", a * 100 + b);
}

int main() {
	p[0] = 1;
	rep(i, 1, 10) p[i] = p[i - 1] * 10;
	rep(i, 1, blo) s[i] = s[i / 10] + (i % 10);
	rep(j, 0, 100) per(k, 99, 0) {
		int v = j + k + s[k];
		if(v < 100) f[0][j][k] = f[0][j][v]; else f[0][j][k] = v % 100;
	}
	rep(i, 1, 10) rep(j, 0, 100) rep(k, 0, 99) {
		f[i][j][k] = k;
		rep(l, 0, min(9, 100 - j))
			f[i][j][k] = f[i - 1][j + l][f[i][j][k]];
	}
	int t = read();
	while(t --) {ll x = read(), y = read(); solve(x, y);}
	return 0;
}