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.

[[-54, 43, 14, 3, -181, 28], [-137, -54, -62, -1], [40, -168, -120, -195, 17, -9, 6], [-100, 36, 80], [-9, 30, 73, 32]]
[43, -1, 40, 80, 73]

[[-50, 43, 3], [53, -199, 72, -60], [-135, 10, -186, -112], [92, -118, 88, -13, -183, -152, -20], [-173, -114, 85, -130, -153], [-186, -104], [-153, -52, -33, 41, -117, 16, -188], [-77, -47, -26, 19, -93]]
[43, 72, 10, 92, 85, -104, 41, 19]

[[42, 64, -125, -4, -135, -29, -37], [-138, -120, -160], [-149, -184, -30, 58, -63], [-176, -1, -159], [43, 18], [42, -80, -59], [14, -121, -99], [-72, 15, 40], [-1, -198]]

[64, -120, 58, -1, 43, 42, 14, 40, -1]