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.

[[-122, -130], [-22, 85, 73, -35], [-134, -96, 30], [49, -68, -166], [-75, -193, -193], [68, 50, -166, -111, -65, 25], [-109, 72, 22, -170, -106, -32, 66]]
[-122, 85, 30, 49, -75, 68, 72]

[[-53, -26, -156, 87], [-73, -173, 18, -40, -175, 99], [-171, -75, 15, 18, -90, -162, -104]]
[87, 99, 18]

[[-18, -153, 98, -195], [-154, -184, -85, -25, -121, -55], [-153, -57, -109, 42], [-101, -163], [76, 11, -100, -160, 62, -181, -1], [88, 92, 83, -44, -164], [-11, -91, 82, -166, -126, -22], [53, -186, -21, 25, -191, -100], [44, 30, -195, -56, 53, -183]]

[98, -25, 42, -101, 76, 92, 82, 53, 53]