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.

[[-54, 43, 14, 3, -181, 28], [-137, -54, -62, -1], [40, -168, -120, -195, 17, -9, 6], [-100, 36, 80], [-9, 30, 73, 32]]
[43, -1, 40, 80, 73]

[[41, -199, -65, -168, -36, 58, -56], [-77, -129, 54, -46, 54, -38, -171], [-163, 100, -20, -74, -64], [50, 65, -124, -61, -167, 53, 38]]
[58, 54, 100, 65]

[[19, 87, -142, -45, -180, -1], [-31, -74], [-125, -167, 87, 97, 97, -55, -68], [99, -126], [-13, 54, -130, -196, -43, -194], [-60, -41, 27, -22], [41, -196, -114, -68, 35, 69, -6]]

[87, -31, 97, 99, 54, 27, 69]