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.

[[-116, 74, -148, -128, 83, -15, 92], [29, -115], [-186, -195, -2, -125, -22, -120]]
[92, 29, -2]

[[-53, -26, -156, 87], [-73, -173, 18, -40, -175, 99], [-171, -75, 15, 18, -90, -162, -104]]
[87, 99, 18]

[[-187, -74, -95, -170, -190, -61, -119], [-151, -197], [63, -132, -145, -124], [-169, -69, -48, -114], [-31, -89, -187, -198, -63, 2], [66, 19]]

[-61, -151, 63, -48, 2, 66]