def ntimes_list(nums,n):
    
    result = map(lambda x:n*x, nums) 
    return list(result)
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums