def min_product_tuple(list1):
    
    result_min = min([abs(x * y) for x, y in list1] )
    return result_min
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums