def index_on_inner_list(list_data, index_no):
    from operator import itemgetter
    
    result = sorted(list_data, key=itemgetter(index_no))
    return result
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums