def intersection_nested_lists(l1, l2):
    
    result = [[n for n in lst if n in l1] for lst in l2]
    return result
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums