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.
[[-30, -12, -96, -200], [-39, -136, -152, 79, 47], [-86, -70, -189, -10, -17, -162, -159], [1, 9, 94, -11, -159, -20], [-198, -81, 92, -145], [-71, -107, -144, -177, -24], [-39, -54, -6]]