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.
[[-36, -200, 39, 10], [94, 100, 32, -192], [-9, -175], [68, -121, 24, -51, -42, 17, -127], [-112, -38], [19, -34, -21, -141, 15], [-5, 34, 31, -177]]