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.

[[-28, -118, -156, -57, -161], [-29, -157, -63, 77]]
[-28, 77]

[[-134, -48, 4, 24, 71, -187, -166], [44, 10, 44, -55], [-63, -29, 15, -89, 78, 63, -106], [-112, -11, -134, 87, -46], [-128, -93, 68, -87], [-147, -63, 91]]
[71, 44, 78, 87, 68, 91]

[[44, -21], [54, -195, -78, -185, -198], [28, -59, -58, 81, -32], [-108, -78], [91, -70, -37]]

[44, 54, 81, -78, 91]