import sys
# import threading

# import sys
# import threading

def main():
    import sys
    # sys.setrecursionlimit(1 << 25)
    q = int(sys.stdin.readline())
    queries = []
    for _ in range(q):
        x_str, y_str = sys.stdin.readline().split()
        x = int(x_str)
        y = int(y_str)
        queries.append((x, y))

    for x, y in queries:
        visited = set()
        while x <= y and x not in visited:
            visited.add(x)
            s = sum(map(int, str(x)))
            x += s
        print(x)
        
# threading.Thread(target=main).start()
            
# threading.Thread(target=main).start()
main()



"""

def main_2():
    import sys
    sys.setrecursionlimit(1 << 25)
    q = int(sys.stdin.readline())
    queries = []
    for _ in range(q):
        x_str, y_str = sys.stdin.readline().split()
        x = int(x_str)
        y = int(y_str)
        queries.append((x, y))

    for x, y in queries:
        while x <= y:
            s = sum(map(int, str(x)))
            # Compute the minimal t to reach next change in sum of digits
            # For simplicity, we can assume t = 1 (since sum_of_digits changes frequently)
            # But to optimize, we can compute t more accurately

            # Check if adding s will exceed y
            if x + s > y:
                x += s
                break

            # Compute t_max where sum_of_digits(x + s * t) remains the same
            # We can approximate t_max as the minimal t where any digit rolls over
            min_t = float('inf')
            x_str = str(x)
            n_digits = len(x_str)
            s_int = int(s)
            for i in range(n_digits):
                digit = int(x_str[-(i+1)])
                # We want to find t such that (digit + s * t) % 10 == 0
                # Solve for t: (digit + s * t) % 10 == 0
                remainder = (10 - digit) % 10
                if s_int == 0:
                    continue  # Avoid division by zero
                t = (remainder) // s_int
                if (remainder) % s_int != 0:
                    t += 1
                if t == 0:
                    t = 10 // s_int
                if t > 0:
                    min_t = min(min_t, t)
            if min_t == float('inf'):
                min_t = 1
            x += s * min_t
            if x > y:
                break
        print(x)

# threading.Thread(target=main).start()
# main_2()
"""