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.

[[-79, -29, 95, 11, -47, -37], [-61, -14, 2, 63, 18, -44, 60], [67, -61, -152, -108, -184, 85], [-7, -135, -113, -81, -146, -34], [74, 58], [-139, 40, -181, -95], [83, -28, -200], [80, -130, -174, 36, 19], [12, 70, -198, -62]]
[95, 63, 85, -7, 74, 40, 83, 80, 70]

[[78, -23, -113, -137, 21, 71], [-195, 80], [-169, 20, 35, -101, 91, -78], [-174, 31, -169, -18, -159, 99, -7]]
[78, 80, 91, 99]

[[95, -44, 90, -30, 64, -183, -188], [44, -100, -115], [42, 13, -98, -168], [4, -73, -184, 16]]

[95, 44, 42, 16]