------
## 最终结论
```python
import heapq

def find_minimum_range(arrays):
    min_heap = []
    current_max = float('-inf')
    
    # Fill the initial heap and find the maximum value
    for i, array in enumerate(arrays):
        heapq.heappush(min_heap, (array[0], i, 0))  # (value, array_index, element_index)
        current_max = max(current_max, array[0])
    
    min_range = float('inf')
    result_range = (0, 0)

    while True:
        current_min, array_index, element_index = heapq.heappop(min_heap)
        
        # Calculate the current range
        current_range = current_max - current_min
        
        if current_range < min_range:
            min_range = current_range
            result_range = (current_min, current_max)
        
        # If there are more elements in the popped array, add the next element to the heap
        if element_index + 1 < len(arrays[array_index]):
            next_value = arrays[array_index][element_index + 1]
            heapq.heappush(min_heap, (next_value, array_index, element_index + 1))
            current_max = max(current_max, next_value)
        else:
            break
    
    return result_range
```