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]

[[72, -172, -132, 93], [-200, -74, -56, -40, -68, -163, -58], [-72, -164], [-166, -70, -127, -16, -41, -121, 13], [-56, 91], [-181, 35, -12, -99, -122], [-66, 33], [18, -141, -40, 28, -175, -102, -63]]
[93, -40, -72, 13, 91, 35, 33, 28]

[[-169, 25, -184], [36, -102], [-176, -84, -191, 45, -174, -161], [-6, 37, 22, -62, -174], [-52, -199, -173, -161]]

[25, 36, 45, 37, -52]