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: [[60, -121, -47, -34, -99], [-172, 26], [-87, 61, -54, 39], [-150, 74, -19, -90, 53], [-116, -189, -28, -36]]
Example Output: [60, 26, 61, 74, -28]

Example Input: [[-22, -69, -38, -9, -92, 36], [-169, -140, -163, 86], [10, -73, -36], [-124, 53, 81, -61, 65, -184, -170], [69, -177, -73], [-112, 41, -38], [91, 31, 85, -72, -93, -48, 66], [-73, -180, 34, 16, -175, -28]]
Example Output: [36, 86, 10, 81, 69, 41, 91, 34]

Example Input: [[-104, -131, -16, 62, -83, 95, 20], [-55, 6], [-1, -3], [68, -52, -146, -144, -117], [6, 83]]
Example Output:
[95, 6, -1, 68, 83]