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: [[10, -182, -172, -154, 42, -42, -159], [10, -7, 32, -26], [-79, -77, -179], [57, 21, -139, -114, 23, -177, 24], [-122, 57, -110, 84], [42, -107, -190, -73, -184, -186]]

Output: [42, 32, -77, 57, 84, 42]


Input: Consider Input: [[-198, -161], [66, 7, 92, 36, -103, -44], [-121, 33, 33, -183, 81, -87, 6], [-125, 1, -186]]

Output: [-161, 92, 81, 1]


Input: Consider Input: [[9, 70, 6, -173, -155, 41, 25], [-157, -140, -170, 29, 77, -97], [-27, 41, -132, -184, -61, -136, 89], [-139, -198, -12], [-72, -54], [-94, -141, -83, 23, -37, -108]]


Output: [70, 77, 89, -12, -54, 23]