def sort_sublists(list1):
      
      list1.sort()  
      list1.sort(key=len)
      return  list1
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums