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: [[99, 11, 61, -95], [-186, -124, -20, -125], [-50, 93, -17], [-165, 56, 52, -142], [-88, -46, -178, -37, -126, 24], [84, 100, 18, 71, -135, 44, 96]]

Output: [99, -20, 93, 56, 24, 100]


Input: Consider Input: [[-29, -139], [-113, 72, 88, -95, -146, -186], [31, -151, -171, -180, -87, -12, -181]]

Output: [-29, 88, 31]


Input: Consider Input: [[-20, 75, 87, 24, 49, 99, 86], [81, 30], [-67, -51, -172, -167, -146, 92], [-38, 1, -167, 99, -38]]


Output: [99, 81, 92, 99]