def access_elements(nums, list_index):
    
    result = [nums[i] for i in list_index]
    return result
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums