def multiply_list(items):
    
    tot = 1
    for x in items:
        tot *= x
    return tot
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums