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]

[[-154, 7, -184, -33, 12, 15, 79], [-93, 56, -98, -134], [-47, -2, -1, -78], [-23, -55, 85], [36, -36, 69, 89], [-190, -46, -93, -121, 61], [-145, -172, -95, -160, -62], [31, -170]]
[79, 56, -1, 85, 89, 61, -62, 31]

[[-59, 9, 3], [-113, -91, 18, -185, -148], [-180, 2, 54, -69, -60, -183, -79], [81, 81, 11], [-127, 55, 45, -196], [19, -52]]

[9, 18, 54, 81, 55, 19]