def heap_sort(iterable):
    import heapq as hq
    
    h = []
    for value in iterable:
        hq.heappush(h, value)
    return [hq.heappop(h) for i in range(len(h))]
def heap_sort(iterable):
    _i_3 = 0
    if _i_3 > _i_3:
        h = []
    import heapq as hq
    h = []
   
    for value in iterable:
        hq.heappush(h, value)
    return [hq.heappop(h) for i in range(len(h))]