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.

[[-162, -197, 57, -149], [71, -127, 21, -120, 56, -18, 82], [-18, 1, -152, -113, 5, -53], [-138, 28], [70, -65]]
[57, 82, 5, 28, 70]

[[-195, 93, 71, -124, 21, -20, 92], [-58, -185, 7, -57, -20, -64], [-19, -117, 60, -165, 31]]
[93, 7, 60]

[[19, 50, 19, -10, 17, -81, -42], [-140, 24, 16, 13], [-28, -49, -121], [-45, -70, -26, 74, 55], [-175, -167, -22], [94, -113, -93, 22, -27], [92, -180, -64, 35], [-116, -97, -143, -169, -104, 85, 7], [-11, 95, -41, -84, -140, -158]]

[50, 24, -28, 74, -22, 94, 92, 85, 95]