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]

[[21, -143, 100, -121, 53], [-196, 60, 71], [-71, 38, -90, -65, -98], [-76, -31, -114, 10, -102, -81, 11], [-132, -94, -171, -142, -1, -80, -90], [8, -113, 13], [-114, 79], [-142, -194, -116, -90, 30]]
[100, 71, 38, 11, -1, 13, 79, 30]

[[-11, -12, 29, -159, -150, -76, -67], [-151, 67], [-172, -114, -87, -61], [-175, -166, 1, 3, 25, 27, -82]]

[29, 67, -61, 27]