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.
[[51, -13, -130, -81, -76, 50, -179], [56, 93, 31, -176, -37, 13], [-46, 73, -187, -199], [61, 28, -182, 60, 59, -9, -115]]