import heapq

def merge_sorted_list(num1, num2, num3):
    iterators = [iter(num1), iter(num2), iter(num3)]
    heap = []

    for index, iterator in enumerate(iterators):
        try:
            value = next(iterator)
            heapq.heappush(heap, (value, index, iterator))
        except StopIteration:
            pass

    while heap:
        value, index, iterator = heapq.heappop(heap)
        yield value
        try:
            next_value = next(iterator)
            heapq.heappush(heap, (next_value, index, iterator))
        except StopIteration:
            pass