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: [[-23, 34], [-9, -35, 39, -132, -43], [-195, 62, -128, -159, 62, -122, -109], [-98, 66, 28], [-48, 38], [-85, -91, -181, -129], [-125, -140, -162, -66, -2], [-196, -53, -117]]
Example Output: [34, 39, 62, 66, 38, -85, -2, -53]

Example Input: [[-88, 24], [-125, -39], [95, -76, -84, -69, -190, -148], [-196, 71, -2, -91, -112]]
Example Output: [24, -39, 95, 71]

Example Input: [[-21, -163, -76, -128, -43, -32, 10], [76, -192, -82, -4, -73, 26], [-56, 16, 15], [-198, 70, 35, 55, -7, -135], [-12, -138, 95]]
Example Output:
[10, 76, 16, 70, 95]