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.
[[-167, -37, -70, -42], [-176, -178, -139, 91], [86, 80, -118, -159, -39, -186], [-12, -57, 49, 61], [29, -144, -90, -145, 30, -198, -7], [-173, 71, 75, -157], [2, -61, -15, -136, -192], [71, -141, 2]]