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.
[[49, -170, -37, -71, 40, -166, 54], [-47, -135, 96, 26, 0, -111, 58], [-7, -183, -29, -87], [99, 69, -177], [-130, -128, -195, 76, -130], [70, -197, -147, -55, -10, -26], [-63, 33, -128], [4, -166, -163], [-147, -138, 75, 29]]