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.

[[40, -40, -148, -172], [-116, -46, 92, -51, -20], [-161, -93, 46, -56], [3, -153, 79, -38, 62, -57]]
[40, 92, 46, 79]

[[95, 39, -13, -74, -49, -40, 31], [57, -5, 12, -24, 50, 50, 14], [-195, -144], [-90, 66], [-151, -149, -117, 54, 41, -168], [-67, 52, -41, -156, 24, 37], [-48, 20, 93, -94, -152], [-80, -95, 100, -95], [-178, 21]]
[95, 57, -144, 66, 54, 52, 93, 100, 21]

[[-91, -31, -30, 31], [-147, 55, -200, -14, -134, -15], [-195, 16, -176, -133], [-69, -3, 9, 3], [-4, -188, -115, -121, -140, -133, -155]]

[31, 55, 16, 9, -4]