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.

[[-161, 54], [-41, 74], [74, 84, -87, 28, -181], [-44, 9, 40, -67, -193]]
[54, 74, 84, 40]

[[-163, -129, -176, 12], [-28, -195, -125, -107, 23, 69], [-128, -129, -47, -30], [-53, -56, -32, -67, -7, -81, -156]]
[12, 69, -30, -7]

[[-191, -162, -191, -124, -26], [-145, -184, 24], [-171, -175, -159, -83, -55, 54], [31, -6, 36], [-97, -80, -9, 13, -48, -170, 76], [90, -71, -117, -175]]

[-26, 24, 54, 36, 76, 90]