In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.

Input: Consider Input: [[92, 72, -149, -138, -138, -155, -174], [50, -85, -69, -41], [-48, -72, -116, -197], [70, -140, -34, -178], [1, 50, -175, 18], [-127, -73, -45, -68, 30, -175, -65], [-53, -178, 6, 14, -158, -176, -112], [7, -183], [62, -91, 38, -46, -126]]

Output: [92, 50, -48, 70, 50, 30, 14, 7, 62]


Input: Consider Input: [[65, -176], [77, 97, -198, -72, -92, 10], [-147, 17], [-49, 33], [-49, -27, -78, -184, -94, -146, 14], [-193, -145, -81, -38, -161]]

Output: [65, 97, 17, 33, 14, -38]


Input: Consider Input: [[93, 82, -4, 23, -8, -67], [-151, -173, -26], [68, -148, -135, 1], [-19, 68, 24], [-99, -67], [-162, -59, 9]]


Output: [93, -26, 68, 68, -67, 9]