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.
[[28, -96, -172, -111, -47, -57], [-125, 37, -37, -200, -53, 46], [-121, 6, -71, -98, -195, 95, 10], [-52, -181, -14, 34], [-30, 35, -32, -18, -159, -68, -25], [-165, -73, -162, -163, 48], [-99, -37]]