def left_insertion(a, x):
    import bisect
    
    i = bisect.bisect_left(a, x)
    return i
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums