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.

[[-67, 92, 59, -49, -22, -8], [-65, 28, -120, -118, -63, -19, -160], [10, 46, -37, 65, -184, 99, 52], [-18, 15, 6]]
[92, 28, 99, 15]

[[44, 44, 75, -181, 49, -30], [-102, -76, -66, 57, -83, -162], [-40, -167, 21, -29, 75, -195], [20, -158], [-125, -95], [8, -148, -4, 20, 9, -188, -157]]
[75, 57, 75, 20, -95, 20]

[[-161, -142, -8, 51, 80, -96], [-7, 73, 4, 70, -92, -118], [61, -122], [-67, -78, -138, -137, -155, 14], [-70, 5, -67, -27, -149, 91, 83], [40, 27]]

[80, 73, 61, 14, 91, 40]