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: [[-60, -149, -20], [31, -93, -100, -187, -19, 18, 93], [-171, 17], [-97, -86, -188, -76, 91], [5, 69, -169], [-148, 44], [-180, -21, -51, -198], [-193, -197, -103, 98, 80, -148], [-158, -43, 25, -150, -153]]

Output: [-20, 93, 17, 91, 69, 44, -21, 98, 25]


Input: Consider Input: [[-21, -17, -178, 61, -92, -68], [-171, 1, -185, 17, -19, 4, -95]]

Output: [61, 17]


Input: Consider Input: [[9, -108, -162, -143, -18, -185, 24], [-194, -142, -116, 96, -171, 48, 92], [-63, 68, -192, -24, -166, -163], [-149, 10, 21], [-159, -119], [55, 79, 36, 57], [-43, 4], [-99, 78, 36, -61, -136, 20]]


Output: [24, 96, 68, 21, -119, 79, 4, 78]