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.

[[96, -174], [-117, 48, -174, 19, -26, -7], [-151, 65, 16, -195], [19, 15], [-136, -26], [-118, -82, 95, 67], [-80, -160, -30, -94, -11, -55]]
[96, 48, 65, 19, -26, 95, -11]

[[32, 6, -107, -152, -73, -30], [-124, 26, -37], [21, -149, 19, -37, 72, -200], [-170, 53, 39, 0, -4, 31, -48], [49, 47, -77, 58, -75, -55, 75], [-68, 58], [-35, -170, 92, -167, -5], [-35, 44, -78, 32, -58, -31, 19]]
[32, 26, 72, 53, 75, 58, 92, 44]

[[97, 26, -92, 18, -101], [-195, -32, -135], [3, -124, -173], [-175, -122, 92, 38, -186, -161], [-123, 9, -193, -64, -106], [69, -195, -88, -91, -73, -177]]

[97, -32, 3, 92, 9, 69]