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: [[-94, -23, -131, -75], [94, 72, -29, -30, -63, 86], [42, -62, -33], [34, -167], [-197, 7, -89, -184, 96], [-75, -131, 2, -6, -111, 77, -36], [48, -32, -41, 73], [-178, 60, -5, 39, 40, -27], [-47, -192, -25, -122, -38, -100]]

Output: [-23, 94, 42, 34, 96, 77, 73, 60, -25]


Input: Consider Input: [[-176, 36, 94, 7, 55, 29], [-66, 24, -23, -199, -43, -40], [-99, -187, -132, -129, 12]]

Output: [94, 24, 12]


Input: Consider Input: [[-164, -198, 46, -36], [37, -138, -166], [-11, -36, -29, -126], [27, -27]]


Output: [46, 37, -11, 27]