def check_element(test_tup, check_list):
  
  res = False
  for ele in check_list:
    if ele in test_tup:
      res = True
      break
  return (res) 
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums