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: [[60, -121, -47, -34, -99], [-172, 26], [-87, 61, -54, 39], [-150, 74, -19, -90, 53], [-116, -189, -28, -36]]
Example Output: [60, 26, 61, 74, -28]

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: [[77, -181, 47, -86], [-86, -73], [34, -83, -81, -142, -129, 12], [-40, -191, 13], [10, -108, 76], [54, -80, -173, 19, -83]]
Example Output:
[77, -73, 34, 13, 76, 54]