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: [[-26, -118, -136, -177, -61, -195, -191], [-118, -3, -34, -155, -125]]
Example Output: [-26, -3]

Example Input: [[95, 39, -13, -74, -49, -40, 31], [57, -5, 12, -24, 50, 50, 14], [-195, -144], [-90, 66], [-151, -149, -117, 54, 41, -168], [-67, 52, -41, -156, 24, 37], [-48, 20, 93, -94, -152], [-80, -95, 100, -95], [-178, 21]]
Example Output: [95, 57, -144, 66, 54, 52, 93, 100, 21]

Example Input: [[-5, 1, 60, 44, 69, -136, -88], [16, -57], [61, 79], [61, -13, -139, -18, -9, 65, -102], [42, -69]]
Example Output:
[69, 16, 79, 65, 42]