```python
import heapq
import math

class Element:
    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

def find_smallest_range(lists):
    if not lists or any(not lst for lst in lists):
        return []

    min_heap = []
    current_max = -math.inf
    
    for i, current_list in enumerate(lists):
        first_value = current_list[0]
        heapq.heappush(min_heap, Element(first_value, i, 0))
        current_max = max(current_max, first_value)

    range_start = min_heap[0].value
    range_end = current_max

    while True:
        min_element = heapq.heappop(min_heap)
        
        current_range_size = current_max - min_element.value
        if current_range_size < range_end - range_start:
            range_start = min_element.value
            range_end = current_max

        list_num = min_element.list_num
        next_index = min_element.index + 1

        if next_index >= len(lists[list_num]):
            break

        next_value = lists[list_num][next_index]
        heapq.heappush(min_heap, Element(next_value, list_num, next_index))
        current_max = max(current_max, next_value)
            
    return [range_start, range_end]
```