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: [[-40, -40, 89, -120, 33], [-157, -13, 7, 45], [35, -131, 87, -23], [-125, 77, 68, -106, -2], [89, -90, 15, -2, 42, -95, 72], [-4, -179], [-119, -79], [41, -12, -110]]
Example Output: [89, 45, 87, 77, 89, -4, -79, 41]

Example Input: [[10, -121, -54, -1, -69, -181], [83, -37, -173, -81, -42], [-117, 86, -6, -54, -21], [-171, 22, -69]]
Example Output: [10, 83, 86, 22]

Example Input: [[33, -84, 89, -178, 33, -48], [-15, -31, -154, -158, 60, -93, -125], [84, 23, -149, 84], [38, 77], [-96, 75, 13, -65, -26], [71, -163, -137, 31, 33, 29], [-125, 85, 46, -75, 33, -125]]
Example Output:
[89, 60, 84, 77, 75, 71, 85]