def num_position(text):
 import re
 
 for m in re.finditer("\d+", text):
    return m.start()
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums