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.

[[77, -129, -165, -23, -25, 84], [-148, -184, -130, -48, 66], [12, -10, -184, -198, -76], [-15, -102, 62, 49], [32, -91]]
[84, 66, 12, 62, 32]

[[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]]
[87, 98, 50, -118, -43, 80, -100]

[[-100, 28, -116, -149, -156, -95, -103], [-46, 18, -125, -130, -81, -63]]

[28, 18]