def intersection_array(array_nums1,array_nums2):
 
 result = list(filter(lambda x: x in array_nums1, array_nums2)) 
 return result
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums