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.

[[-88, 24], [-125, -39], [95, -76, -84, -69, -190, -148], [-196, 71, -2, -91, -112]]
[24, -39, 95, 71]

[[95, -100, -10], [-52, -130, -16, -86, -37, -181], [-126, -10, 3, -135, -67, 64, -5], [-101, -96, -155, -12, -63], [-130, -187, 20, 45], [-176, 87, -135, -75, -90, -189, -200], [-53, 74, -52, 29, -150], [-192, 48, -15, -148, -175], [75, -148]]
[95, -16, 64, -12, 45, 87, 74, 48, 75]

[[-52, 64], [78, -116, -156, -93], [-65, -176, -148, 96, -154, -117, -175], [-139, -49, -166, -23, -179, 100, 10], [-148, 53, -105, -47, 66, 44, -99], [88, -165], [-116, -1, 58]]

[64, 78, 96, 100, 66, 88, 58]