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: [[-128, -167, 12, -33, -120], [-16, -175], [-97, 34, -3, 41, -72], [50, 39, -128, -26, -96, -58]]
Example Output: [12, -16, 41, 50]

Example Input: [[-7, 38, 91, -146, -16, -169], [48, -155, 86, -44, 100, -92, 31], [-114, -7, -28, 51, 86, -4, 76], [84, 82, 71], [13, 2], [22, 53, -152], [-32, -137, -157], [-55, 14, -129, -58, 54, -10]]
Example Output: [91, 100, 86, 84, 13, 53, -32, 54]

Example Input: [[89, -175, -143], [-180, 35, -151, -136, 59, 88, -81], [25, -23], [-34, -41, 95, 25]]
Example Output:
[89, 88, 25, 95]