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.
[[-71, -19, -146, -73], [-120, -9, -45, -40, 6, -58], [-109, -104, -16, -198, -96, 77], [75, -145, -28], [-121, -100, -27, 9], [99, -138], [-191, -1, -106]]