class Solution:
    def __init__(self, value, list_num, index):
        self.value = value
        self.list_num = list_num
        self.index = index
    
    def __lt__(self, other):
        return self.value < other.value


import heapq

def find_smallest_range(lists):
    heap = []
    current_max = float('-inf')
    
    for i, lst in enumerate(lists):
        heapq.heappush(heap, Solution(lst[0], i, 0))
        current_max = max(current_max, lst[0])
    
    best_range = [float('-inf'), float('inf')]
    
    while len(heap) == len(lists):
        node = heapq.heappop(heap)
        current_min = node.value
        
        if current_max - current_min < best_range[1] - best_range[0]:
            best_range = [current_min, current_max]
        
        next_index = node.index + 1
        if next_index < len(lists[node.list_num]):
            next_val = lists[node.list_num][next_index]
            heapq.heappush(heap, Solution(next_val, node.list_num, next_index))
            current_max = max(current_max, next_val)
    
    return best_range