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.

[[-42, -57, 13, -41], [45, -68, -199]]
[13, 45]

[[-136, 95, 65, -186, 5, 66, -28], [58, -34, -115, -148, 35], [-50, -167, -1, -64, -98, 72], [-169, -19, 99, 25, -55, 93, 37], [80, -153, -95, -95, -179], [62, 89, 79, -200, -13, -171, -153], [-61, -18], [-157, -25]]
[95, 58, 72, 99, 80, 89, -18, -25]

[[-53, -28], [-65, -58], [-187, -153, 71], [-120, -2, -143, -188, 28, -63], [-76, -174, -38, 37, -118, 0, -178], [-198, 0, -184]]

[-28, -58, 71, 28, 37, 0]