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: [[-120, 64, 10, -43], [-7, -30, -37, -45, 4, -185], [-17, 44, -62, -97, -5, 10, -20], [7, 91, -56, 24], [-138, -169, -139, -172, 57, -53], [62, 31, 12, 20, -182, -188, -198], [-45, -3, -11, -187], [-10, -200, -76, -160, -151]]
Example Output: [64, 4, 44, 91, 57, 62, -3, -10]

Example Input: [[6, -22, -195, 87], [-198, 60, 87, 19, 98, -147, 94], [-62, 50], [-159, -118, -193], [-165, -176, -157, -43, -121, -73], [32, 51, -24, -37, 80], [-110, -100, -198, -145]]
Example Output: [87, 98, 50, -118, -43, 80, -100]

Example Input: [[-18, -91, 6, 87, 21, 100], [-49, 61, 96, -89], [26, 78, -112, 28, -164, -23, 81], [100, -144, -94, 39], [-143, -141], [-28, 8, -37, -174], [10, 50, -54, 44]]
Example Output:
[100, 96, 81, 100, -141, 8, 50]