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.
[[80, -177, -139], [15, -116, -92, -71], [-199, -2, -110, -167, -150], [52, -135, 56, -119, 36], [-77, -91, -140, 78, -20, 98, -113], [-149, -200, -181], [-112, -151, -71, 20], [-165, 40], [-118, -188, -172, -125, -153, -195, -76]]