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.
--------
Question: [[-48, -41, 45, -29, -161], [-163, -76]]

Answer: [45, -76]


Question: [[44, 44, 75, -181, 49, -30], [-102, -76, -66, 57, -83, -162], [-40, -167, 21, -29, 75, -195], [20, -158], [-125, -95], [8, -148, -4, 20, 9, -188, -157]]

Answer: [75, 57, 75, 20, -95, 20]


Question: [[-132, 51, -121], [-123, -194, -188, 49, 47, -33, -10], [86, -119, -59, 58, 74, -75, 77], [-65, -109, 66, -108, -51], [30, 74, -151, -11, -11, -30], [-151, -181], [-117, 32, 49, -173], [-176, -152, 25, -56, -15]]

Answer:
[51, 49, 86, 66, 74, -151, 49, 25]