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.
[[-140, -179, 68, -26, 55, 24, -162], [78, -141, -160, -139], [-114, -67, -7, -169, -85], [4, 60, -108, -106], [51, 19, -162, 31, -100, -77, -54], [71, 89, -161], [20, -195, -94, -140, 41, -179], [-108, -106, 35, 68, -7, -70], [-121, 91, -24, -137, 84, 6]]