def Find_Min_Length(lst):
      
    minLength = min(len(x) for x in lst )
    return minLength 
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums