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: [[-61, -130, -161, 8, -36, 53, -21], [-30, 55, -48, -10, -25, -183, -1], [-92, 93], [-144, -105, -78, 90, -32], [-87, -168, -25, 75, -48, -51, -86], [10, -17, 6]]
Example Output: [53, 55, 93, 90, 75, 10]

Example Input: [[-78, 45], [-124, 37, 96, 43], [-24, -6, -137], [-99, -191, -101, -52], [-9, -100, -193, 24, -31, -112]]
Example Output: [45, 96, -6, -52, 24]

Example Input: [[-53, -166, -63, 44, -37, -88], [-91, -83, 89, 5, -85, -138, 56], [-120, -40, -100, 9, -107, -178], [-183, -73, -46]]
Example Output:
[44, 89, 9, -46]