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.

Example Input: [[-30, -21, 67], [-65, -176, 26, -20, -45, -93], [-102, -159, 28, -66, 41, 66], [99, -193, -188, -141, 65, -71, 72]]
Example Output: [67, 26, 66, 99]

Example Input: [[98, -129, 10], [-55, -168, -73, -44, -68], [-177, 91, 98, 7, -39, 85], [-26, -129, -100, 19], [-154, -80, -1], [50, -171, 3], [49, -164, 98, -108, 9, -18, -176], [-81, -17], [-30, 48, -122, -134]]
Example Output: [98, -44, 98, 19, -1, 50, 98, -17, 48]

Example Input: [[-165, -49, -162], [47, -107, -58, 96, -87, -129, -158], [-58, -59, 6, 52], [23, -79, 78, 29], [-100, -141, -9, 18], [-183, -117, 50, -198, 88, -11], [26, 86, 23, -106, 60, 35]]
Example Output:
[-49, 96, 52, 78, 18, 88, 86]