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.

[[-157, -89, -63], [-97, 82, -159, 40, -15], [-25, 52, 24, 79, -114, 16, 54]]
[-63, 82, 79]

[[-150, 25, -177, 29, 1], [85, 82, -6, -151, -93, -182], [-181, 99, 32, 16, -116, 89], [-29, -186, -40, -7, -64, -29, -33], [-27, -68, -126], [-77, -3, -144]]
[29, 85, 99, -7, -27, -3]

[[-79, -69, 72, -176, -87, -101, -18], [74, 28, -77, -161, -33, 57, 94], [-144, -181, -17, -200, 40, 17], [-75, 53, -1], [-120, -50, 44, -160, 38]]

[72, 94, 40, 53, 44]