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.
[[25, -25, -74, -112, 32, 95, 40], [-147, 7, 62, -96, -168, -51], [-62, -199], [-162, -94, 90, -185], [-78, -129, 13, -72], [75, -107, -144, -162, 63, -191, 93], [22, -55, 9]]