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.

[[-155, -167, -150, 0], [16, -57, -93, -128, -43, -97, 22], [17, -179, -11, 15], [-77, -129, 48, -163, -66], [-52, 31, -142, 80, 48, -15]]
[0, 22, 17, 48, 80]

[[20, 65, 13, -95, -32, -125, -94], [-133, -105, -155], [20, 61, -12, 47], [71, 82, 50, -151, -30], [-1, 80, 98, 2, -145, -21, -67]]
[65, -105, 61, 82, 98]

[[-26, 42], [-130, -98, 13], [-112, -173, 49, -29, -15], [-25, -87, -163, -25, 0], [99, -132, 58, 44, -109], [63, 6, 93, 24], [90, 73, -20, -94, 30, -1, -180], [-176, -111]]

[42, 13, 49, 0, 99, 93, 90, -111]