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: [[-124, -174, -30, -67], [44, -156, -76, 68, -145, -19, -178], [-18, -104, -19, -63, -15], [-99, 12, -129, 38, 4]]

Output: [-30, 68, -15, 38]


Input: Consider Input: [[-61, -173, -114, -165, -42], [88, 66], [-180, -162, 19, -92, 91, -102, -166], [-98, -156, -21, -13], [34, -133, -111]]

Output: [-42, 88, 91, -13, 34]


Input: Consider Input: [[46, -19, -94], [-72, 66], [-16, 84, 11, -196, -118], [-155, -152, -8, -180], [29, -182, -8], [2, -97, -32, -42, -38]]


Output: [46, 66, 84, -8, 29, 2]