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: [[-15, 18, 88, 39, -96], [-65, -76, 85, 2, -58], [41, -103], [-15, -196, -94, 13], [-57, 25, -169, -18, 42, -114], [-131, -61, 20, 42, -92, -50], [-93, -35], [-22, -200, -74, 17, -67, -17]]
Example Output: [88, 85, 41, 13, 42, 42, -35, 17]

Example Input: [[30, -72, 78, 12, -87, -118, 40], [-139, 17, 10, -139, -120, 53, -127], [-122, 28, -161, 93, 9, -171], [-195, 86, -34, 15, 73], [-71, -31, -147, -106]]
Example Output: [78, 53, 93, 86, -31]

Example Input: [[-60, 58, 12, 71, -35, -12, 87], [-30, -117, 95, 29, 17, -120], [-61, -119, -126, 64, -47], [-111, -24], [22, -9, 98, 51, 39, 87]]
Example Output:
[87, 95, 64, -24, 98]

