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: [[-136, 95, 65, -186, 5, 66, -28], [58, -34, -115, -148, 35], [-50, -167, -1, -64, -98, 72], [-169, -19, 99, 25, -55, 93, 37], [80, -153, -95, -95, -179], [62, 89, 79, -200, -13, -171, -153], [-61, -18], [-157, -25]]
Example Output: [95, 58, 72, 99, 80, 89, -18, -25]

Example Input: [[-194, -52, 35, -70], [-101, -197]]
Example Output: [35, -101]

Example Input: [[-86, -103, 69], [-69, -188, -84, -83, -124, 80, -184], [-148, -145, 95, -196, -141, 15, -3], [-171, -113, 82, -125, -71], [-132, 87, -95, 92, -119]]
Example Output:
[69, 80, 95, 82, 92]