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: [[-48, -41, 45, -29, -161], [-163, -76]]
Example Output: [45, -76]

Example Input: [[70, -85, -168, -181, -49, -105], [-178, -54, -86, -113, -16], [1, 51, -127, -18], [-61, 80, -64], [-45, -175, -125], [-138, -96, -112, -14, -77, -188], [84, -96, 32, -165], [-125, -42, 88, 4, 60, -122, 89], [49, -84]]
Example Output: [70, -16, 51, 80, -45, -14, 84, 89, 49]

Example Input: [[-133, -106, -186, -119, -32], [-2, 72, 89, -98, -77, -2], [-67, -147, 38], [-126, -169, -177, -111], [61, -85], [-6, -15, -183, 67], [-126, 0, -19, 67], [-81, 49]]
Example Output:
[-32, 89, 38, -111, 61, 67, 67, 49]